from collections import defaultdict
n, m, k = map(int,input().split())

mat = [[[0] * (m) for i in range(m)] for j in range(30)]

t = defaultdict(int)

for i in range(m):
	t[m//(i+1)] += 1

g = list(t.items())
m = len(g)

mod = 998244353
for i in range(m):
	for j in range(m):
		if abs(g[i][0] - g[j][0]) <= k:
			mat[0][j][i] = g[j][1] % mod

for num in range(29):
	for i in range(m):
		for j in range(m):
			for k in range(m):
				mat[num+1][i][j] += mat[num][i][k] * mat[num][k][j] % mod
			mat[num+1][i][j] %= mod

ans = [g[i][1] for i in range(m)]
n -= 1
for num in range(30):
	if n >> num & 1:
		na = [0] * m
		for i in range(m):
			for j in range(m):
				na[i] += mat[num][i][j] * ans[j] % mod
			na[i] %= mod
		ans = na

print(sum(ans) % mod)