def create_fact_mod(num_max)
    $fmod = Array.new(num_max + 1)
    $fmod[0] = 1
    $fmod[1] = 1
    (2..num_max).each do |i|
        $fmod[i] = ($fmod[i - 1] * i) % MOD
    end
end

def create_seq_inv_mod(num_max)
    $simod = Array.new(num_max + 1)
    $simod[0] = 1
    $simod[1] = 1
    (2..num_max).each do |i|
        $simod[i] = (MOD - MOD / i) * $simod[MOD % i] % MOD
    end
end

def create_fact_inv_mod(num_max)
    $fimod = Array.new(num_max + 1)
    $fimod[0] = 1
    $fimod[1] = 1
    (2..num_max).each do |i|
        $fimod[i] = ($fimod[i - 1] * $simod[i]) % MOD
    end
end

def create_mod_tables(n)
    create_fact_mod(n)
    create_seq_inv_mod(n)
    create_fact_inv_mod(n)
end

def comb_mod(n, k)
    return $fmod[n] * $fimod[n - k] * $fimod[k] % MOD
end

def perm_mod(n, k)
    return $fmod[n] * $fimod[n - k] % MOD
end

MOD = 10**9+7
N, K = gets.split.map(&:to_i)
create_mod_tables(2000)

if N == K
    puts 1, [0]*(K-1)
    exit
end

(1..K).each do |t|
    ans = 0
    if N-K >= t-1 && t > 1
        ans += comb_mod(N-K-1, t-2)
    end
    if N-K >= t+1
        ans += comb_mod(N-K-1, t)
    end
    if N-K >= t
        ans += comb_mod(N-K-1, t-1) * 2
    end
    ans = ans * comb_mod(K-1, t-1) % MOD
    puts ans
end