N, M, K = map(int, input().split())

def compress(A):
    S = sorted(set(A))
    D = dict()
    for i in range(len(S)):
        D[S[i]] = i
    return S, D

def matrix(a, b):
    ans = [[0]*len(b[0]) for _ in range(len(a))]
    for i in range(len(a)):
        for j in range(len(b[0])):
            ans[i][j] = sum(a[i][k]*b[k][j] for k in range(len(b)))%MOD
    return ans

if N == 1:
    exit(print(M))
N -= 1

MOD = 998244353
A = []
for i in range(1, M+1):
    A.append(M//i)
S, idx = compress(A)
L = len(S)

ansM = [[0] for _ in range(L)]
for i in range(1, M+1):
    ansM[idx[M//i]][0] += 1
A = [[0]*L for _ in range(L)]
for i in range(L):
    for j in range(L):
        if abs(S[i]-S[j]) <= K:
            A[i][j] = ansM[i][0]

A = [[a[:] for a in A]]
for i in range(29):
    A.append(matrix(A[-1], A[-1]))

for i in range(30):
    if 1<<i & N:
        ansM = matrix(A[i], ansM)

ans = 0
for a in ansM:
    ans += a[0]
    ans %= MOD

print(ans)