Buggy python submission (verdict: Runtime Error):
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    return int(factorial(n) / factorial(r) / factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
for i in range(1,K+1):
    comb = int(factorial(N-K+1) / factorial(i) / factorial(N-K+1-i) % mod)
    sec = int(factorial(K-1) / factorial(i-1) / factorial(K-i) % mod)
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(700000)
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
for i in range(1,K+1):
   
    comb = int(factorial(K-1) / factorial(i-1) / factorial(K-i) % mod)
   
    
    sec = int(factorial(N-K+1) / factorial(N-K-i+1) / factorial(i) % mod)
   
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(700000)
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
for i in range(1,K+1):
    try:
        comb = int(factorial(K-1) / factorial(i-1) / factorial(K-i) % mod)
    except ValueError:
        comb = 1
    try:
        sec = int(factorial(N-K+1) / factorial(N-K-i+1) / factorial(i) % mod)
    except ValueError:
        sec = 1
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
for i in range(1,K+1):
    try:
        comb = int(factorial(K-1) / factorial(i-1) / factorial(K-i))
    except ValueError:
        comb = 1
    try:
        sec = int(factorial(N-K+1) / factorial(N-K-i+1) / factorial(i))
    except ValueError:
        sec = 1
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)

Buggy python submission (verdict: Runtime Error):
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
for i in range(1,K+1):
    comb = int(factorial(K-1) / factorial(i-1) / factorial(K-i))
    try:
        sec = int(factorial(N-K+1) / factorial(N-K-i+1) / factorial(i))
    except ValueError:
        sec = 1
    print((comb * sec)%mod)

Fixed submission:
from math import factorial
N,K = map(int, input().split())
mod = 10**9 + 7
def com(n,r):
    if n<r:
        return 0
    return int(factorial(n) // factorial(r) // factorial(n-r))
for i in range(1,K+1):
    comb = com(N-K+1,i)
    sec = com(K-1,i-1)
    print((comb * sec)%mod)