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



def cmb(n, r, p):

    if (r < 0) or (n < r):

        return 0

    r = min(r, n - r)

    return (fact[n] * factinv[r] * factinv[n-r]) % p



p=10**9 + 7

fact=[1, 1]

factinv=[1, 1]

inv=[0, 1]

 

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

    fact.append((fact[-1] * i) % p)

    inv.append((-inv[p % i] * (p // i)) % p)

    factinv.append((factinv[-1] * inv[-1]) % p)





for i in range(K):

    print(((cmb(N-K+1,i+1,p)*cmb(K-1,i,p))%p))
import sys

input = sys.stdin.readline



def I(): return int(eval(input()))

def MI(): return list(map(int, input().split()))

def LI(): return list(map(int, input().split()))



def main():

    mod=10**9+7

    N,K=MI()

    #0~Nまで逆元などを事前計算



    def cmb(n, r, mod):

        if (r < 0) or (n < r):

            return 0

        r = min(r, n - r)

        return (fact[n] * factinv[r] * factinv[n-r])%mod



    fact=[1,1]

    factinv=[1,1]

    inv=[0,1]



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

        fact.append((fact[-1] * i) % mod)

        inv.append((-inv[mod % i] * (mod // i)) % mod)

        factinv.append((factinv[-1] * inv[-1]) % mod)

        

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

        ans=(cmb(N-K+1,i,mod)*cmb(K-1,i-1,mod))%mod

        print(ans)

        

        

        



main()

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


def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return (fact[n] * factinv[r] * factinv[n - r]) % p


p = 10**9 + 7
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
for i in range(K):
    print(((cmb(N - K + 1, i + 1, p) * cmb(K - 1, i, p)) % p))

import sys

input = sys.stdin.readline


def I():
    return int(eval(input()))


def MI():
    return list(map(int, input().split()))


def LI():
    return list(map(int, input().split()))


def main():
    mod = 10**9 + 7
    N, K = MI()
    # 0~Nまで逆元などを事前計算
    def cmb(n, r, mod):
        if (r < 0) or (n < r):
            return 0
        r = min(r, n - r)
        return (fact[n] * factinv[r] * factinv[n - r]) % mod

    fact = [1, 1]
    factinv = [1, 1]
    inv = [0, 1]
    for i in range(2, N + 1):
        fact.append((fact[-1] * i) % mod)
        inv.append((-inv[mod % i] * (mod // i)) % mod)
        factinv.append((factinv[-1] * inv[-1]) % mod)
    for i in range(1, K + 1):
        ans = (cmb(N - K + 1, i, mod) * cmb(K - 1, i - 1, mod)) % mod
        print(ans)


main()

-N, K = list(map(int, input().split())) +import sys + +input = sys.stdin.readline -def cmb(n, r, p): -    if (r < 0) or (n < r): -        return 0 -    r = min(r, n - r) -    return (fact[n] * factinv[r] * factinv[n - r]) % p +def I(): +    return int(eval(input())) -p = 10**9 + 7 -fact = [1, 1] -factinv = [1, 1] -inv = [0, 1] -for i in range(2, N + 1): -    fact.append((fact[-1] * i) % p) -    inv.append((-inv[p % i] * (p // i)) % p) -    factinv.append((factinv[-1] * inv[-1]) % p) -for i in range(K): -    print(((cmb(N - K + 1, i + 1, p) * cmb(K - 1, i, p)) % p)) +def MI(): +    return list(map(int, input().split())) + + +def LI(): +    return list(map(int, input().split())) + + +def main(): +    mod = 10**9 + 7 +    N, K = MI() +    # 0~Nまで逆元などを事前計算 +    def cmb(n, r, mod): +        if (r < 0) or (n < r): +            return 0 +        r = min(r, n - r) +        return (fact[n] * factinv[r] * factinv[n - r]) % mod + +    fact = [1, 1] +    factinv = [1, 1] +    inv = [0, 1] +    for i in range(2, N + 1): +        fact.append((fact[-1] * i) % mod) +        inv.append((-inv[mod % i] * (mod // i)) % mod) +        factinv.append((factinv[-1] * inv[-1]) % mod) +    for i in range(1, K + 1): +        ans = (cmb(N - K + 1, i, mod) * cmb(K - 1, i - 1, mod)) % mod +        print(ans) + + +main()