n,k = gets.split.map(&:to_i)
mod = 10**9+7

DP = Array.new(n).map{Array.new(k,1)}

n.times { |s| DP[s][0] = s+1 }

n.times do |s|
  k.times do |t|
    if s>0 && t>0 && s>t
      DP[s][t] = (DP[s-1][t] + DP[s-1][t-1]) % mod
    end
  end
end

def com(n,k)
  return 0 if n<k
  return 1 if n==0 && k==0
  return 1 if k < 1
  return DP[n-1][k-1]
end

(1..k).each do |i|
  ans = com(k-1, i-1)*com(n-k+1, i)
  puts ans % mod
end
