def ncr(n, r)
    1 if r == 0 or r == n
  
    # store C(n,r) in a matrix
    c = Array.new(n+1).map{Array.new(r+1,0)}
    i,j = 0
  
    for i in 0..n
      # C(i,0) = 1 for i = 0...n
      c[i][0] = 1
    end
    for j in 0..r
      # if n = 0, C(n,r) = 0 for all 'r'
      c[0][j] = 0
    end
  
    for i in 1..n
      for j in 1..r
        if i == j
          # C(n,n) = 1
          c[i][j] = 1
        elsif j > i
          # case when r > n in C(n,r)
          c[i][j] = 0
        else
          # apply the standard recursive formula
          c[i][j] = c[i-1][j-1] + c[i-1][j]
        end
      end
    end
  
    return c[n][r]
end
arr = gets.chomp.split(" ").map(&:to_i)
n = arr[0]
k = arr[1]

(k+1).times{|t|
if t != 0 then
    puts ncr(n-k+1,t)*ncr(k-1,t-1)%1000000007
end
}