class Combination
  def initialize(n=10000,mod=10**9+7)
    @n,@mod=n,mod
    @fact =  Array.new(n+1)
    @fact[0]=1
    1.upto(n) {|i|@fact[i]=i*@fact[i-1]% @mod}
  end

  def choose(n, r)
    return 0 unless (0 <= r && r <= n)
    return 1 if r == 0 || r == n
    fact(n) * inv( fact(r) * fact(n-r) % @mod ) % @mod
  end

  def mod
    @mod
  end

  def fact(n)
    @fact[n]
  end

  def inv(x)
    pow(x, @mod-2)
  end

  def pow(x, n)
    ans = 1
    while n > 0
      ans = ans * x % @mod if n.odd?
      x = x * x % @mod
      n >>= 1
    end
    ans
  end
end
io = STDIN
n,k=io.gets.split.map(&:to_i)
comb=Combination.new(n)
1.upto(k) do |i|
  p comb.choose(k-1,i-1)*comb.choose(n-k+1,i)%comb.mod
end
