Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))

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

for i in range(1,K+1):
	print(comb(N-K+1,i)*comb(K-1,i-1)%(10**9+7))

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

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

for i in range(1,K+1):
	print(math.factorial(N-K+1)//math.factorial(N-K+1-i)//math.factorial(i)*math.factorial(K-1)//math.factorial(K-i)//math.factorial(i-1)%1000000007)

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))

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

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

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//math.factorial(n-r)//math.factorial(r)

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

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

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//math.factorial(n-r)//math.factorial(r)%1000000007

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

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

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//math.factorial(n-r)//math.factorial(r)%1000000007

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

for i in range(1,K+1):
	print(comb(N-K+1,i)*comb(K-1,i-1))

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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

Buggy python submission (verdict: Runtime Error):
import math

def comb(n,r):
	return math.factorial(n)//math.factorial(n-r)//math.factorial(r)%1000000007

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

for i in range(1,K+1):
	print(comb(N-K+1,i)*comb(K-1,i-1))

Fixed submission:
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def combination(n, r):
	if n >= r:
		return int(factorial(n) // (factorial(r) * factorial(n - r)))
	else:
		return 0

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