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

class Integer
  def combination(k)
    return 1 if k.zero?
    (self - k + 1..self).inject(:*) / k.factorial
  end

  def factorial
    return 1 if self.zero?
    (1..self).inject(:*)
  end
end

def count2(m)
  (N-K+1).combination(m) * (K-1).combination(m-1)
end

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