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

def combi(n ,k):
    return math.factorial(n)/(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Fixed submission:
import math

def combi(n ,k):
    return math.factorial(n)//(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

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

def combi(n ,k):
    return math.factorial(n)/(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = combi(N-K+1,i)*combi(K-1,i-1)
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Fixed submission:
import math

def combi(n ,k):
    return math.factorial(n)//(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Buggy python submission (verdict: Runtime Error):
import math
N, K = map(int, input().split())

cnt_list = []
for i in range(K):
  C1 = int(math.factorial(N-K+1))/int((math.factorial(i+1)*math.factorial(N-K+1-i-1)))
  C2 = int(math.factorial(K-1))/int((math.factorial(i+1-1)*math.factorial(K-1-i+1-1)))
  cnt = int(C1*C2)
  cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Fixed submission:
import math

def combi(n ,k):
    return math.factorial(n)//(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Buggy python submission (verdict: Runtime Error):
import math
N, K = map(int, input().split())

cnt_list = []
for i in range(K):
  C1 = math.factorial(N-K+1)/(math.factorial(i+1)*math.factorial(N-K+1-i-1))
  C2 = math.factorial(K-1)/(math.factorial(i+1-1)*math.factorial(K-1-i))
  cnt = int(C1*C2)
  cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Fixed submission:
import math

def combi(n ,k):
    return math.factorial(n)//(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Buggy python submission (verdict: Runtime Error):
import math
N, K = map(int, input().split())

cnt_list = []
for i in range(K):
  C1 = math.factorial(N-K+1)/(math.factorial(i+1)*math.factorial(N-K+1-i-1))
  C2 = math.factorial(K-1)/(math.factorial(i+1-1)*math.factorial(K-1-i))
  cnt = int(C1*C2)
  cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])

Fixed submission:
import math

def combi(n ,k):
    return math.factorial(n)//(math.factorial(k)*math.factorial(n-k))

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

cnt_list = []
for i in range(1,K+1):
    if N-K+1 >= i:
        cnt = int(combi(N-K+1,i)*combi(K-1,i-1))
    else:
        cnt =0
    cnt_list.append(cnt%(10**9+7))

for i in range(len(cnt_list)):
    print(cnt_list[i])