MOD = 10 ** 9 + 7
CEIL = 10 ** 6

FACT = Array.new(CEIL, 1)
INV  = Array.new(CEIL, 1)
FINV = Array.new(CEIL, 1)

(2 ... CEIL).each do |i|
  FACT[i] = (FACT[i - 1] * i) % MOD
  INV[i] = MOD - (INV[MOD % i] * (MOD / i)) % MOD
  FINV[i] = (FINV[i - 1] * INV[i]) % MOD
end

def combination_mod(n,k)
    return 0 if n < k
    return 0 if (n < 0 || k < 0)
    
    FACT[n] * (FINV[k] * FINV[n - k] % MOD) % MOD;
end


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

ans = (1 .. K).map do |i|
  b = combination_mod(K -  1, i - 1)
  r = combination_mod(K_ + 1, i)
  (b * r) % MOD
end

puts ans
