import sys

import sys

import bisect

import collections

import fractions

import heapq

import math

from operator import mul

from functools import reduce

from functools import lru_cache





def combination(n, r):

    r = min(n - r, r)

    if r == 0:

        return 1

    else:

        return reduce(mul, list(range(n, n - r, -1))) // reduce(mul, list(range(1, r + 1)))





def solve():

    input = sys.stdin.readline

    mod = 10 ** 9 + 7

    n, k = list(map(int, input().rstrip('\n').split()))

    for i in range(k):

        if n - k + 1 >= i + 1 and k - 1 >= i:

            print((combination(n - k + 1, i + 1) % mod * combination(k-1, i) % mod))

        else:

            print((0))





if __name__ == '__main__':

    solve()

import sys





def alg_combination_mod(n, r, mod):

    r = min(n - r, r)

    if r == 0:

        return 1

    else:

        denominator = 1

        for i in range(n, n - r, -1):

            denominator = (denominator * i) % mod

        molecule = 1

        for i in range(1, r + 1):

            molecule = (molecule * i) % mod

        return denominator * pow(molecule, mod - 2, mod) % mod







def solve():

    input = sys.stdin.readline

    mod = 10 ** 9 + 7

    n, k = list(map(int, input().rstrip('\n').split()))

    for i in range(k):

        if n - k + 1 >= i + 1 and k - 1 >= i:

            print(((alg_combination_mod(n - k + 1, i + 1, mod) * alg_combination_mod(k - 1, i, mod)) % mod))

        else:

            print((0))





if __name__ == '__main__':

    solve()

import sys
import sys
import bisect
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache


def combination(n, r):
    r = min(n - r, r)
    if r == 0:
        return 1
    else:
        return reduce(mul, list(range(n, n - r, -1))) // reduce(
            mul, list(range(1, r + 1))
        )


def solve():
    input = sys.stdin.readline
    mod = 10**9 + 7
    n, k = list(map(int, input().rstrip("\n").split()))
    for i in range(k):
        if n - k + 1 >= i + 1 and k - 1 >= i:
            print((combination(n - k + 1, i + 1) % mod * combination(k - 1, i) % mod))
        else:
            print((0))


if __name__ == "__main__":
    solve()

import sys


def alg_combination_mod(n, r, mod):
    r = min(n - r, r)
    if r == 0:
        return 1
    else:
        denominator = 1
        for i in range(n, n - r, -1):
            denominator = (denominator * i) % mod
        molecule = 1
        for i in range(1, r + 1):
            molecule = (molecule * i) % mod
        return denominator * pow(molecule, mod - 2, mod) % mod


def solve():
    input = sys.stdin.readline
    mod = 10**9 + 7
    n, k = list(map(int, input().rstrip("\n").split()))
    for i in range(k):
        if n - k + 1 >= i + 1 and k - 1 >= i:
            print(
                (
                    (
                        alg_combination_mod(n - k + 1, i + 1, mod)
                        * alg_combination_mod(k - 1, i, mod)
                    )
                    % mod
                )
            )
        else:
            print((0))


if __name__ == "__main__":
    solve()

-import sys -import bisect -import collections -import fractions -import heapq -import math -from operator import mul -from functools import reduce -from functools import lru_cache -def combination(n, r): +def alg_combination_mod(n, r, mod): -        return reduce(mul, list(range(n, n - r, -1))) // reduce( -            mul, list(range(1, r + 1)) -        ) +        denominator = 1 +        for i in range(n, n - r, -1): +            denominator = (denominator * i) % mod +        molecule = 1 +        for i in range(1, r + 1): +            molecule = (molecule * i) % mod +        return denominator * pow(molecule, mod - 2, mod) % mod -            print((combination(n - k + 1, i + 1) % mod * combination(k - 1, i) % mod)) +            print( +                ( +                    ( +                        alg_combination_mod(n - k + 1, i + 1, mod) +                        * alg_combination_mod(k - 1, i, mod) +                    ) +                    % mod +                ) +            )