class Integer
  def factorial
    return 1 if self == 0
    (1..self).inject(:*)
  end

  def permutation(r)
    return 1 if self == 0
    s = self - r + 1
    (s..self).inject(:*)
  end

  def combination(r)
    r = [r, self - r].min
    return self if r == 1
    return 1 if r == 0
    self.permutation(r) / r.factorial
  end
end

n, k = gets.split.map(&:to_i)

(1..k).each do |i|
  if i == 1 || i == k
    puts ((n-k+1).combination(i)) % 1000000007
  else
    puts (n-k+1).permutation(i) % 1000000007
  end
end