N, K = gets.split.map(&:to_i)
M = N - K

def fact(num)
  if num < 1
    return 1
  else
    ans = 1
    num.times do |n|
      ans *= n+1
    end
    return ans
  end
end

def comb(n, i)
  fact(n) / (fact(i) * fact(n-i))
end

mod_num = (10**9)+7

(1..K).each do |k|
  if k > M+1
    p 0
  else
    hoge = comb(K-1, k-1)
    fuga = comb(M+1, k)
    p hoge * fuga % mod_num
  end
end
