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

  def factorial(step = 1) # 4! = 24
    return 1 if self.zero?
    (1..self).inject(:*)
  end
end

n, k = gets.split.map(&:to_i)
ao  = k
aka = n - k
1.upto(ao) do |i|
  p (aka+1).combination(i) % (10**9 + 7) * (ao-1).combination(i-1) % (10**9 + 7)
end
