mod = 1000000007
n, k = gets.chomp.split(' ').map(&:to_i)

$memo = {}
def combination(n, k)
  $memo[n] = {} if $memo[n] == nil
  $memo[n][k] = 1 if k == 0
  return $memo[n][k] if $memo[n][k] != nil
  $memo[n][k] = combination(n, k - 1) * (n - k + 1) / k
end

1.upto(k) do |i|
  puts (combination(n - k + 1, i) % mod) * (combination(k - 1, i - 1) % mod) % mod
end
