import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def merge(aa, bb):
    res = [0]*n
    for i, a in enumerate(aa):
        for j, b in enumerate(bb):
            res[(i+j)%n] = (a*b+res[(i+j)%n])%md
    return res

n, k, l = LI()
base = [0]*n
for i in range(1, l+1): base[i%n] = 1
ans = [1]+[0]*(n-1)
while k:
    if k & 1: ans = merge(ans, base)
    base = merge(base, base)
    k >>= 1

print(*ans,sep="\n")