N, K = list(map(int, input().split()))

mod = 1000000007





def factorial_2(N: int, M: int) -> int:

    res = 1

    for i in range(2, N+1):

        res *= i

        res %= M

    return res





def nCr(n: int, r: int, mod: int):

    if n == r:

        return 1

    if r > n:

        return 0

    return (factorial_2(n, mod) * pow((factorial_2(n-r, mod) * factorial_2(r, mod)), mod-2, mod)) % mod





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

    print((nCr(N-K+1, i, mod) * nCr(K-1, i-1, mod) % mod))

import math



N, K = list(map(int, input().split()))

mod = 1000000007





def nCr(n: int, r: int):

    if n == r:

        return 1

    if r > n:

        return 0

    return math.factorial(n) // (math.factorial(n-r) * math.factorial(r))





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

    print((nCr(N-K+1, i) * nCr(K-1, i-1) % mod))

N, K = list(map(int, input().split()))
mod = 1000000007


def factorial_2(N: int, M: int) -> int:
    res = 1
    for i in range(2, N + 1):
        res *= i
        res %= M
    return res


def nCr(n: int, r: int, mod: int):
    if n == r:
        return 1
    if r > n:
        return 0
    return (
        factorial_2(n, mod)
        * pow((factorial_2(n - r, mod) * factorial_2(r, mod)), mod - 2, mod)
    ) % mod


for i in range(1, K + 1):
    print((nCr(N - K + 1, i, mod) * nCr(K - 1, i - 1, mod) % mod))

import math

N, K = list(map(int, input().split()))
mod = 1000000007


def nCr(n: int, r: int):
    if n == r:
        return 1
    if r > n:
        return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


for i in range(1, K + 1):
    print((nCr(N - K + 1, i) * nCr(K - 1, i - 1) % mod))

+import math + -def factorial_2(N: int, M: int) -> int: -    res = 1 -    for i in range(2, N + 1): -        res *= i -        res %= M -    return res - - -def nCr(n: int, r: int, mod: int): +def nCr(n: int, r: int): -    return ( -        factorial_2(n, mod) -        * pow((factorial_2(n - r, mod) * factorial_2(r, mod)), mod - 2, mod) -    ) % mod +    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) -    print((nCr(N - K + 1, i, mod) * nCr(K - 1, i - 1, mod) % mod)) +    print((nCr(N - K + 1, i) * nCr(K - 1, i - 1) % mod))