MOD = 1000000007
N, K = gets.split.map(&:to_i)

$c = Array.new(N+2).map{Array.new(N+2, 0)}

def init_c()
    $c[0][0] = 1
    for i in 0...$c.length-1
        for j in 0..i
            $c[i+1][j] += $c[i][j]
            $c[i+1][j+1] += $c[i][j]

            $c[i+1][j] %= MOD
            $c[i+1][j+1] %= MOD
        end
    end
end

def comb(a, b)
    return $c[a][b]
end

def f2(x, y)
    comb(x+y-1, y-1)
end

# x個の玉をy個のグループに分ける場合の数
def f(x, y)
    f2(x-y, y)
end

init_c()

for i in 1..K

    blue = f(K, i)

    red = 0
    red += f(N-K, i-1)
    red += f(N-K, i)
    red += f(N-K, i)
    red += f(N-K, i+1)
    red %= MOD

    ans = blue * red % MOD
    puts ans
end