#include <map>
#include <cmath>
#include <vector>
#include <iostream>
using namespace std;

int main() {
	// step #1. preparation
	const int MOD = 998244353;
	auto matmul = [&](int n, vector<vector<int> > a, vector<vector<int> > b) {
		vector<vector<int> > c(n, vector<int>(n));
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				for (int k = 0; k < n; k++) {
					c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % MOD;
				}
			}
		}
		return c;
	};
	auto matpow = [&](int n, vector<vector<int> > a, int k) {
		vector<vector<int> > c(n, vector<int>(n));
		for (int i = 0; i < n; i++) {
			c[i][i] = 1;
		}
		while (k != 0) {
			if (k % 2 == 1) {
				c = matmul(n, c, a);
			}
			a = matmul(n, a, a);
			k /= 2;
		}
		return c;
	};

	// step #2. input
	int N, M, K;
	cin >> N >> M >> K;

	// step #3. calculation
	map<int, int> d;
	for (int i = 1; i <= M; i++) {
		d[M / i]++;
	}
	int Z = d.size();
	vector<int> v, c;
	for (pair<int, int> i : d) {
		v.push_back(i.first);
		c.push_back(i.second);
	}
	vector<vector<int> > mat(Z, vector<int>(Z));
	for (int i = 0; i < Z; i++) {
		for (int j = 0; j < Z; j++) {
			if (abs(v[i] - v[j]) <= K) {
				mat[i][j] = c[j];
			}
		}
	}
	vector<vector<int> > res = matpow(Z, mat, N - 1);
	int ans = 0;
	for (int i = 0; i < Z; i++) {
		for (int j = 0; j < Z; j++) {
			ans = (ans + 1LL * c[i] * res[i][j]) % MOD;
		}
	}
	
	// step #4. output
	cout << ans << endl;

	return 0;
}