import sys
input = sys.stdin.readline
N, K, L = map(int, input().split())
mod = 10 ** 9 + 7

dp = [[0] * N for _ in range(N)]

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

def ArrayMultiple(a, b, mod):
  n = len(a)
  m = len(b[0])
  c = [[0] * n for _ in range(n)]
  for i in range(n):
    for j in range(m):
      for k in range(n):
        c[i][j] += a[i][k] * b[k][j]
        c[i][j] %= mod
  return c

def ArrayPower(a, k, mod):
  bn = list(bin(k)[2: ])
  ln = len(bn)
  n = len(a)
  bn.reverse()
  res = [[int(i == x) for i in range(n)] for x in range(n)]
  for i in range(ln):
    if int(bn[i]):
      res = ArrayMultiple(res, a, mod)
    a = ArrayMultiple(a, a, mod)
  return res

res = ArrayPower(dp, K, mod)[0]
for r in res: print(r)