def fact(n)
  @facts ||= [1]
  (@facts.size).upto(n){|i| @facts << @facts[-1]*i % MOD}
  return @facts[n]
end

def modpow(x,n)
  ret = 1
  while n > 0
    ret = (ret * x) % MOD if n&1 == 1
    x = (x*x) % MOD
    n >>= 1
  end
  return ret
end

def modinv(x)
  return modpow(x,MOD-2)
end

def combin(n,k)
  return (((fact(n) * modinv(fact(n-k))) % MOD) * modinv(fact(k))) % MOD
end

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

1.upto(k) do |i|
  t = 0
  t += combin(n-k-1,i) if n-k-1 >= i
  t += combin(n-k-1,i-1) * 2 if n-k-1 >= i-1
  t += combin(n-k-1,i-2) if n-k-1 >= i-2 && i-2 >= 0
  t %= MOD
  p (combin(k-1,i-1) * t) % MOD
end