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

def combination(n, k)
  return 1 if k == 0
  up, down = 1, 1
  n.downto(n - k + 1) do |i|
    up *= i
  end
  1.upto(k) do |i|
    down *= i
  end
  up / down
end

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