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

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

1.step(k) do |i|
  if n-k-i+1 < 0
    puts 0
  else
    puts combination(n-k+1, i) * combination(k-1, i-1) % (10**9 + 7)
  end
end
