Buggy python submission (verdict: Runtime Error):
#132 12:55
n,k=map(int,input().split())
mod=7+10**9
def C(i,j):
    def a(n):
        b=1
        if n==0:
            return 1
        else:
            for x in range(1,n+1):
                b=b*x
            return b
    return int(a(i)/(a(j)*a(i-j)))

answer=[]
for i in range(1,k+1):
    if n-k-i+1<0:
        continue
    else:
        answer.append( (C(k-1,i-1)%mod)*(C(n-k+1,i)%mod ))
for i in range(len(answer)):
    print(answer[i]%mod)


Fixed submission:
N, K = map(int, input().split())
R = N-K
RR = R-1
mod = 10**9+7

def nCr(n,r):
    K = 1
    for j in range(1,r+1):
        K = K*(n+1-j)//j
    return K

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

Buggy python submission (verdict: Runtime Error):
#132 12:55
n,k=map(int,input().split())
mod=7+10**9
def C(i,j):
    def a(n):
        b=1
        if n==0:
            return 1
        else:
            for x in range(1,n+1):
                b=b*x
            return b
    return int(a(i)/(a(j)*a(i-j)))

answer=[]
for i in range(1,k+1):
    if n-k-i+1<0:
        answer.append(0)
    else:
        answer.append( (C(k-1,i-1)%mod)*(C(n-k+1,i)%mod ))
for i in range(k):
    print(answer[i]%mod)


Fixed submission:
N, K = map(int, input().split())
R = N-K
RR = R-1
mod = 10**9+7

def nCr(n,r):
    K = 1
    for j in range(1,r+1):
        K = K*(n+1-j)//j
    return K

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

Buggy python submission (verdict: Runtime Error):
#132 12:55
n,k=map(int,input().split())
def C(i,j):
    def a(n):
        b=1
        if n==0:
            return 1
        else:
            for x in range(1,n+1):
                b=b*x
            return b
    return int(a(i)/(a(j)*a(i-j)))

answer=[]
for i in range(1,k+1):
    if n-k-i+1<0:
        answer.append(0)
    else:
        answer.append( C(k-1,i-1)*C(n-k+1,i) )
for i in range(k):
    print(answer[i]%(7+10**9))


Fixed submission:
N, K = map(int, input().split())
R = N-K
RR = R-1
mod = 10**9+7

def nCr(n,r):
    K = 1
    for j in range(1,r+1):
        K = K*(n+1-j)//j
    return K

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

Buggy python submission (verdict: Runtime Error):
#132 12:55
n,k=map(int,input().split())
def C(i,j):
    def a(n):
        b=1
        for x in range(1,n+1):
            b=b*x
        return b
    return int(a(i)/(a(j)*a(i-j)))

answer=[]
for i in range(1,k+1):
    if n-k-i+1<0:
        answer.append(0)
    else:
        answer.append( C(k-1,i-1)*C(n-k+1,i) )
for i in range(k):
    print(answer[i]%(7+10**9))


Fixed submission:
N, K = map(int, input().split())
R = N-K
RR = R-1
mod = 10**9+7

def nCr(n,r):
    K = 1
    for j in range(1,r+1):
        K = K*(n+1-j)//j
    return K

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

Buggy python submission (verdict: Runtime Error):
#132 12:55
n,k=map(int,input().split())
def C(i,j):
    def a(n):
        b=1
        for x in range(1,n+1):
            b=b*x
        return b
    return int(a(i)/(a(j)*a(i-j)))

answer=[]
for i in range(1,k+1):
    if n-k-i+1<0:
        answer.append(0)
    else:
        answer.append( C(k-1,i-1)*C(n-k+1,i) )
for i in range(k):
    print(answer[i]%(7+10**9))


Fixed submission:
N, K = map(int, input().split())
R = N-K
RR = R-1
mod = 10**9+7

def nCr(n,r):
    K = 1
    for j in range(1,r+1):
        K = K*(n+1-j)//j
    return K

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