N, K = gets.split.map(&:to_i)
MOD = 10**9 + 7

def mpow(x, n)
  ret = 1
  while n > 0
    if n.even?
      x = x * x % MOD
      n >>= 1
    else
      ret = ret * x % MOD
      n -= 1
    end
  end
  ret
end

def f(i) # K-1 C i
  return 0 if i > K - 1
  @f ||= [1]
  @f[i] ||= @f[i - 1] * (K - i) * mpow(i, MOD - 2) % MOD
end

def g(i) # N-K+1 C i
  return 0 if i > N - K + 1
  @g ||= [1]
  @g[i] ||= @g[i - 1] * (N - K - i + 2) * mpow(i, MOD - 2) % MOD
end

(1 .. K).each{|i| puts f(i - 1) * g(i) % MOD}