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

def combination(n, k)
  k = n - k if 2 * k > n
  return 1 if k == 0
  ((n - k + 1)..n).reduce(&:*)/((1..k).reduce(&:*))
end

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