from functools import *

# 行列 a * b を返す

def mat_mul(a, b) :
    I, J, K = len(a), len(b[0]), len(b)
    c = [[0] * J for _ in range(I)]
    for i in range(I) :
        for j in range(J) :
            for k in range(K) :
                c[i][j] += a[i][k] * b[k][j]
            c[i][j] %= mod
    return c

# 行列 x ^ n を返す

# @lru_cache(maxsize=None)
def mat_pow(x, n):
    y = [[0] * len(x) for _ in range(len(x))]
    for i in range(len(x)):
        y[i][i] = 1
    while n > 0:
        if n & 1:
            y = mat_mul(x, y)
        x = mat_mul(x, x)
        n >>= 1
    return y

mod = 998244353
n, m, k = map(int, input().split())
a = [[int(abs(m // (j + 1) - m // (i + 1)) <= k) for j in range(m)] for i in range(m)]
ans = 0
for i in mat_mul(mat_pow(a, n - 1), [[1] for _ in range(m)]):
    ans += i[0]
print(ans % mod)