#!/usr/bin/env ruby

MOD = (10 ** 9) + 7
nnn, kkk = gets.chomp.split.map(&:to_i)


$hoge = {}

def conbi(n, k)
  k=n-k if 2*k > n
  return 1 if k == 0
  return $hoge[[n,k]] if $hoge[[n,k]]
  $hoge[[n, k]] = ((n-k+1)..n).reduce(&:*)/((1..k).reduce(&:*))
end

kkk.times do |i|
  if (i+1) <= nnn-kkk+1
    puts ((conbi(kkk - 1, i)% MOD) * (conbi(nnn-kkk+1, i+1)%MOD))%MOD
  else
    puts 0
  end
end
