MOD=1000000007
class FACT
  def initialize
    @fact = (1..3000).to_a
    @fact.each_with_index do |e, idx|
      @fact[idx] = @fact[idx] * @fact[idx-1] % MOD if idx > 0
    end
  end

  def c(n, r)
    return 0 if not (0 <= r and r <= n)
    return 1 if r == 0 or r == n
    fact(n) * inverse( fact(r) * fact(n-r) % MOD ) % MOD
  end

  def h(n,r)
    return 1 if r==0 || n==1
    return fact(n+r-1)*inverse(fact(r)*fact(n-1) % MOD) % MOD
  end
  def fact(n)
    @fact[n-1]
  end

  def inverse(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
f=FACT.new
n,k = gets.split.map(&:to_i)
for i in 1..k
  puts f.c(n-k+1,i)*f.c(k-1,i-1) % MOD
end
