N,K=$<.read.split.map(&:to_i)
MOD=10**9+7

class Combination
    def initialize(size,mod)
        @size = size
        @mod = mod
        @fac = []
        @finv = []
        @inv = []
        @fac[0] = @fac[1] = 1;
        @finv[0] = @finv[1] = 1;
        @inv[1] = 1;

        i = 2
        while i < size
            @fac[i] = @fac[i - 1] * i % mod
            @inv[i] = mod - @inv[mod%i] * (mod / i) % mod
            @finv[i] = @finv[i - 1] * @inv[i] % mod
            i += 1
        end
    end

    def [](n,k)
        return 0 if n < k
        return 0 if n < 0 || k < 0
        @fac[n] * (@finv[k] * @finv[n-k] % @mod) % @mod
    end
end


comb=Combination.new(N,MOD)
blue = K
red = N-K
1.upto(K) do |i|
    if red < i-1 
        puts 0
    else
        puts comb[K-1,i-1] * comb[N-K+1,i] % MOD

    end
end