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

def combi_upper(n, k)
  return 1 if k.zero?
  @combi_u ||= {}
  @combi_u[n] ||= {}
  @combi_u[n][k] ||= (n - k + 1) * combi_upper(n, k - 1)
end

def factorial(n)
  return 1 if n.zero?
  @fac ||= {}
  @fac[n] ||= n * factorial(n - 1)
end

def combination(n, k)
  combi_upper(n, k) / factorial(k)
end

def count(m)
  combination(N-K+1, m) * combination(K-1, m-1)
end

1.upto(K) do |i|
  puts count(i) % (10**9 + 7)
end
