# 剰余系
class Integer
  MOD = 1000000007
  @@inverse = {}
  # a + b
  def plus(other)
    (self + other) % MOD
  end
  # a - b
  def minus(other)
    (self - other) % MOD
  end
  # a * b
  def mult(other)
    ((self % MOD) * (other % MOD)) % MOD
  end
  # a / b
  def divi(other)
    ((self % MOD) * other.inverse) % MOD
  end
  # a ** b
  def power(n)
    res = 1
    a = self
    while (n > 0) do
      res = res.mult(a) if n[0]==1
      a = a.mult(a)
      n = n >> 1
    end
    res
  end
  # nCk
  def combi(k)
    return 0 if self < k
    k = self - k if 2 * k > self
    return 1 if k == 0
    (((self - k + 1)..self).reduce(&:mult)).divi ((1..k).reduce(&:mult))
  end
  # 逆元
  def inverse
    @@inverse[self] ||= self.power(MOD - 2)
  end
end

N, K = gets.split(' ').map(&:to_i)
R = N - K
(1..K).each do |i|
  puts (N-K+1).combi(i) .mult (K-1).combi(i-1)
end