Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!


from scipy.special import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!


from scipy.special import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = comb(k-1, i-1, exact=True) % mod
    b = comb(n-k+1, i, exact=True) % mod 
    print(a*b%mod)

Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!


from scipy.special import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = comb(k-1, i-1, exact=True) % mod
    b = comb(n-k+1, i, exact=True) % mod 
    print(a*b%mod)

Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!

import math 

n,k = map(int,input().split())



for i in range(1,k+1):
    a = 1
    b = 1
    for j in range(1,i+1):
        a *= (n-k+2-j)/j
        a = int(a)
    for j in range(1,i):
        b *= (k-j)/j
        b = int(b)
    a = int(a)
    b = int(b)
    a %= 10**9+7
    b %= 10**9+7
    print(a*b%(10**9+7))


Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!

import math 

n,k = map(int,input().split())



for i in range(1,k+1):
    a = 1
    b = 1
    for j in range(1,i+1):
        a *= (n-k+2-j)/j
    for j in range(1,i):
        b *= (k-j)/j
    a = int(a)
    b = int(b)
    a %= 10**9+7
    b %= 10**9+7
    print(a*b%(10**9+7))


Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!

import math 

n,k = map(int,input().split())



for i in range(1,k+1):
    a = 1
    b = 1
    for j in range(1,i+1):
        a *= (n-k+2-j)/j
    for j in range(1,i):
        b *= (k-j)/j
    a %= 10**9+7
    b %= 10**9+7
    print(int(a*b)%(10**9+7))


Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!

import math 

n,k = map(int,input().split())

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
    
for i in range(1,k+1):
    #　青はボールk-i,仕切りi-1
    a = combinations_count(k-1, i-1) % (10**9 + 7)
    # 赤ノボールはn-k-(i-1).仕切りi
    b = combinations_count(n-k-(i-1)+i, i) % (10**9 + 7)
    print(a*b%(10**9 + 7))

Fixed submission:
# coding: utf-8
# Your code here!


from scipy.misc import comb
mod = 10**9 + 7

n,k = map(int,input().split())

for i in range(1,k+1):
    a = int(comb(k-1, i-1, exact=True)) % mod
    b = int(comb(n-k+1, i, exact=True)) % mod 
    print(a*b%mod)