#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 998244353;
const int inv[5] = {0, 1, (Mod+1) / 2, (Mod+1) / 3};
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 2000200;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return ((n == m) ? 1 : ((m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])))); }
const double pi = acos(-1);
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }
inline void chmin(ll &a, ll b){ (b<a) ? (a=b) : 0; }

ll N, K, T;

int n, tp0, s;
int f[2000200];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	initfact(2000020);

	cin >> N >> K >> T;
	if(K > 2000000 || (K-1) * K / 2 > N || K * (K+1) / 2 + K < N) return cout << "0\n", 0;

	if(K * (K+1) / 2 > N)
		n = (int)(K), tp0 = 1, s = (int)(N - (K-1) * K / 2);
	else 
		n = (int)(K+1), tp0 = 0, s = (int)(N - K * (K+1) / 2);

	//cout << n << " " << s << " " << tp0 << "\n";

	for(int l = 1; l <= n; ++l) if(n % l == 0){
		int cnt = n/l;
		if(s % cnt != 0) continue;
		int c1 = s / (cnt);
		for(int k = 0; k <= c1; ++k){
			int val1 = binom(c1 - 1, k - 1);
			if(!val1) continue;
			rep(tp1, 2){
				int val0 = binom(l - c1 - 1, k-1 + (!tp0) + (!tp1) - 1);
				if(!val0) continue;
				umul(val0, val1);
				//cout << "  " << l-c1-1 << " " << k-1 << "+" << (!tp0) << "+" << (!tp1) << "\n";
				int c10;
				if(tp0 && tp1) c10 = (k-1) * cnt;
				else if(tp0) c10 = k * cnt;
				else if(tp1) c10 = k * cnt - 1;
				else c10 = k * cnt;
				//cout << " " << l << " " << k << " " << tp1 << " " << val1 << " " << val0 << " " << c10 << "\n";
				uadd(f[l], mul(val0, mul(fact[K], invpw2[c10])));
			}
		}
		//cout << l << ": " << f[l] << "\n";
	}

	for(int i = 1; i <= n; ++i) if(n % i == 0) for(int j = i+i; j <= n; j += i) usub(f[j], f[i]);

	int ans = 0;
	for(int i = 1; i <= n; ++i) if(n % i == 0 && T % i == 0) uadd(ans, f[i]);
	cout << ans << "\n";
	
	return 0;
}