from collections import Counter

# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

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

mod=998244353

LIST=[0]*(M+1)

for i in range(1,M+1):
    LIST[i]=M//i

C=Counter(LIST[1:])

X=sorted(C)

DP=[[0]*len(X) for i in range(len(X))]

for i in range(len(X)):
    for j in range(len(X)):
        if abs(X[i]-X[j])<=K:
            DP[i][j]=C[X[j]]

POWA=[DP]

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],len(X),len(X),len(X))) # ベキを求めて

Y=[0]*len(X)

for i in range(len(X)):
    Y[i]=C[X[i]]

N-=1
Y=[Y]
while N:
    Y=prod(Y,POWA[N.bit_length()-1],1,len(X),len(X)) # n乗の場合
    N-=1<<(N.bit_length()-1)

print(sum(Y[0])%mod)