N, K = gets.split.map(&:to_i)

MOD = 10 ** 9 + 7
def comb_mod(a, b)
  return 0 if a < b
  return comb_mod(a, a - b) if b > a - b
  mul = div = 1
  b.times do |i|
    mul *= a - i
    div *= i + 1
    mul %= MOD
    div %= MOD
  end
  mul * pow_mod(div, MOD - 2) % MOD
end

def pow_mod(a, pow)
  if pow == 0
    1
  elsif pow.odd?
    a * pow_mod(a, pow - 1) % MOD
  else
    half = pow_mod(a, pow / 2)
    half * half % MOD
  end
end

1.upto(K) do |i|
  puts (comb_mod(N - K + 1, i) * comb_mod(K - 1, i - 1)) % MOD
end
