import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

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

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

def matpow(a, n):
    if n == 0:
        return [[1 if i == j else 0 for j in range(len(a))] for i in range(len(a))]
    elif n == 1:
        return a
    if n % 2 == 0:
        return matpow(matmul(a, a), n // 2)
    return matmul(a, matpow(a, n - 1))

mod = 998244353
n, m, k = na()

a = []
for i in range(1, m+1):
    if not a or a[-1][0] != m // i:
        a.append((m // i, 1))
    else:
        a[-1] = (m // i, a[-1][1] + 1)
#print(len(a))
A = [[0] * len(a) for _ in range(len(a))]

for i in range(len(a)):
    for j in range(len(a)):
        if abs(a[i][0] - a[j][0]) <= k:
            A[i][j] = a[j][1]

v = [a[i][1] for i in range(len(a))]


res = matmul2(v, matpow(A, n-1))
print(sum(res) % mod)