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

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

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

mod = 10**9+7

def main():

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

    A = [[0]*n for i in range(n)]
    for c in range(n):
        for x in range(1, l+1):
            nc = (c+x)%n
            A[nc][c] += 1
    X = [0]*n
    X[0] = 1
    A = mat_pow(A, k, mod)
    for i in range(n):
        ans = 0
        for j in range(n):
            ans += A[i][j]*X[j]
            ans %= mod
        print(ans)

if __name__ == '__main__':
    main()