import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
ulong bignum = 1_000_000_007;
alias Pair = Tuple!(long, "number", long, "times");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

auto comb = new long[][](2019, 2019);

void calc_comb(long limit)
{
    long times;
    comb[times++][0] = 1;
    comb[times][0] = comb[times][1] = 1;
    while (++times < limit)
    {
        long row;
        while (row <= times)
        {
            if (row == 0)
            {
                comb[times][row] = 1;
                row++;
                continue;
            }

            comb[times][row] = (comb[times - 1][row] + comb[times - 1][row - 1]) % bignum;
            row++;
        }
    }

}

void main()
{
    long n, blue;
    scan(n, blue);
    auto red = n - blue;
    calc_comb(n + 1);
    foreach (i; 1.. blue + 1)
    {
        // comb[red + 1][i].write(" ");
        // comb[blue - 1][i - 1].writeln();
        auto ans = comb[red + 1][i] * comb[blue - 1][i - 1];
        ans %= bignum;
        ans.writeln();
    }
}
