require 'pp'
require 'set'

n, k = gets.chomp!.split(" ").map(&:to_i)

$per_memo = {
    1 => 1
}

MOD = (10 ** 9) + 7 

def fractional(n)
    return 1 if n <= 1
    return $per_memo[n] if $per_memo[n]

    $per_memo[n] = (n * fractional(n - 1))

    return $per_memo[n]
end

def permutation(n, r)
    (fractional(n) / fractional(n - r))
end

def combination(n, r)
    (permutation(n, r) / fractional(r)) % MOD
end

$pascal = {
    1 => {1 => 1},
    2 => {1 => 1, 2 => 1},
}

def pascal(n, i)
    return 1 if n == 1

    if n == i || i == 1
        $pascal[n] ||= {}
        $pascal[n][i] = 1
        return 1
    elsif $pascal[n] && $pascal[n][i]
        return $pascal[n][i] 
    else
        $pascal[n] ||= {}
        $pascal[n][i] = (pascal(n-1, i-1) + pascal(n-1, i)) % MOD
    end
end

k.times do |i|
    # 入れられる場所の数
    red = n - k + 1

    # 入れる青の種類数
    y = pascal(k, i + 1)
    #puts "==="
    #puts red
    #puts y
    #puts "==="

    # 入れられる組み合わせ
    puts (combination(red, i + 1) * fractional(y)) % MOD
    #puts permutation(red, y)
end
