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


f = [1]

n.times do |i|
  f[i+1] = f[i] * (i+1)
end

for i in 1..k
  if i > k
    puts 0
  else
    pat_i = f[n-k+1] / (f[i] * f[n-k+1-i])
    pat_k = f[k-1] / (f[i-1] * f[k-i])
    puts (pat_i * pat_k) % (1_000_000_000 +7)
  end
end