n, k = gets.split.map(&:to_i)
CACHE = {}

def blue(k, i)
  return 0 if k < i
  h(i, k - i)
end

def red(k, i)
  need = i - 1
  return 0 if k < need
  h(i + 1, k - need)
end

def ex(i)
  return 1 if i.zero?
  return CACHE[i] if CACHE.key?(i)
  CACHE[i] = i * ex(i - 1)
end

def c(n, r)
  ex(n) / (ex(r) * ex(n - r))
end

def h(n, r)
  c(n + r - 1, r)
end

(1..k).each do |i|
  ans = blue(k, i) * red(n - k, i)
  puts ans % (10 ** 9 + 7)
end
