#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n, m, k; cin >> n >> m >> k;
	vector mat(30, vector(m, vector<mint>(m)));
	rep(i,0,m)rep(j,0,m){
		if(abs(m/(i+1)-m/(j+1))<=k){
			mat[0][i][j] = 1;
		}
	}
	rep(num,0,29)rep(i,0,m)rep(j,0,m)rep(k,0,m){
		mat[num+1][i][j] += mat[num][i][k] * mat[num][k][j];
	}
	vector<mint> ans(m,1);
	n-=1;
	rep(num,0,30){
		if(n>>num&1){
			vector<mint> na(m,0);
			rep(i,0,m)rep(j,0,m)na[i]+=mat[num][i][j]*ans[j];
			swap(na,ans);
		}
	}
	cout << sum(ans).val() << '\n';

}