def mat_mul(A, B):
    C = [[0]*len(B[0]) for _ in range(len(A))]
    
    for i in range(len(A)):
        for j in range(len(B[0])):
            for k in range(len(A[0])):
                C[i][j] += A[i][k]*B[k][j]
                C[i][j] %= MOD
    
    return C

def mat_pow(A, n):
    res = [[0]*len(A) for _ in range(len(A))]
    
    for i in range(len(A)):
        res[i][i] = 1
    
    while n>0:
        if n&1:
            res = mat_mul(res, A)
        
        n >>= 1
        A = mat_mul(A, A)
    
    return res

N, K, L = map(int, input().split())
MOD = 10**9+7
M = [[0]*N for _ in range(N)]

for i in range(N):
    for j in range(1, L+1):
        M[(i+j)%N][i] += 1

x = [[0] for _ in range(N)]
x[0][0] = 1
res = mat_mul(mat_pow(M, K), x)

for i in range(N):
    print(res[i][0])