Buggy python submission (verdict: Runtime Error):
a=10**9+7
n,k=map(int,input().split())
from math import factorial 
"def c(t, r):
"  return factorial(t)//factorial(t-r)//factorial(r)
def f(x):
  return factorial(x)


for _ in range(1,k+1):
  a1=f(n-k+1)%a
  a2=f(n-k+1-_)
  a3=f(_)
  a4=f(k-1)%a
  a5=f(k-1-_+1)
  a6=f(_-1)
  ans=a1*a4//(a2*a3*a5*a6)%a
  print(ans)

"  print((c(n-k+1,_)%a*c(k-1,_-1)%a))

Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
n,k=map(int,input().split())
from math import factorial 
def c(t, r):
  return factorial(t)//factorial(t-r)//factorial(r)

for _ in range(1,k+1):
  print((c(n-k+1,_)%a*c(k-1,_-1)%a))

Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
n,k=map(int,input().split())
from math import factorial 
def c(t, r):
    return factorial(t)//factorial(t-r)//factorial(r)

for _ in range(1,k+1):
  print((c(n-k+1,_)%a*c(k-1,_-1)%a))

Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
n,k=map(int,input().split())
from math import factorial 
def c(t, r):
    return factorial(t)//(factorial(t-r)*factorial(r))

for _ in range(1,k+1):
  print((c(n-k+1,_)%a*c(k-1,_-1)%a))

Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
import math 
def combinations_count(t, r):
    return (math.factorial(t%a)) // int((math.factorial(t%a - r%a) * math.factorial(r%a)))

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


for _ in range(1,k+1):
  print(combinations_count((n-k+1),_)%a*combinations_count((k-1),(_-1)))

  


Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
import math 
def combinations_count(n, r):
    return (math.factorial(n)) // (math.factorial(n - r) * math.factorial(r))

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


for _ in range(1,k+1):
  print(combinations_count((n-k+1)%a,_%a)%a*combinations_count((k-1)%a,(_-1)%a))

  


Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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

Buggy python submission (verdict: Runtime Error):
a=10**9+7
import math 
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

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


for _ in range(1,k+1):
  print(combinations_count(n-k+1,_)%a*combinations_count(k-1,_-1))

Fixed submission:
mod=10**9+7
n,k=map(int,input().split())

from scipy.misc import comb

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