def matmul(A,B): # A,B: 行列 res = [[0]*len(B[0]) for _ in [None]*len(A)] for i, resi in enumerate(res): for k, aik in enumerate(A[i]): for j,bkj in enumerate(B[k]): resi[j] += aik*bkj resi[j] %= MOD return res def matpow(A,p): #A^p mod M if p%2: return matmul(A, matpow(A,p-1)) elif p > 0: b = matpow(A,p//2) return matmul(b,b) else: return [[int(i==j) for j in range(len(A))] for i in range(len(A))] n,k,L = map(int,input().split()) MOD = 10**9+7 A = [[0]*n for _ in range(n)] for i in range(n): for j in range(1,L+1): A[i][(i+j)%n] = 1 A = matpow(A,k) for i in range(n): print(A[i][0])