class Integer
  MOD = 1000000007
  @@inverse = {}
  def plus(other)
    (self + other) % MOD
  end
  def minus(other)
    (self - other) % MOD
  end
  def mult(other)
    ((self % MOD) * (other % MOD)) % MOD
  end
  def divi(other)
    ((self % MOD) * other.inverse) % MOD
  end
  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
  def inverse
    @@inverse[self] ||= self.power(MOD-2)
  end
end

def combi(n,k)
  return 0 if n < k
  k=n-k if 2*k > n
  return 1 if k == 0
  (((n-k+1)..n).reduce(&:mult)).divi ((1..k).reduce(&:mult))
end

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