#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = 998244353;

using namespace std;

struct mint
{
	int x;
	mint(void) : x(0) {}
	mint(int x) : x(x) {}
	mint operator+ (int ot) const { return x + ot >= INF ? x + ot - INF : x + ot; }
	mint operator- (int ot) const { return x >= ot ? x - ot : x + INF - ot; }
	mint operator- (void) const { return x ? INF - x : 0; }
	mint operator* (int ot) const { return 1ll * x * ot % INF; }
	mint operator+= (int ot) { return *this = *this + ot; }
	mint operator-= (int ot) { return *this = *this - ot; }
	mint operator*= (int ot) { return *this = *this * ot; }
	operator int(void) const { return x; }
};

mint F[3030303];
mint R[3030303];

mint mpow(mint a, ll x)
{
	mint ret = 1;
	while(x)
	{
		if(x & 1) ret *= a;
		a *= a;
		x >>= 1;
	}
	return ret;
}
mint inv(mint a) { return mpow(a, INF - 2); }
mint comb(int n, int r)
{ 
	if(r < 0 || r > n) return 0;
	return F[n] * R[r] * R[n - r];
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	ll n, k, t; cin >> n >> k >> t;

	F[0] = 1;
	for(int i = 1; i < 3030303; ++i) F[i] = F[i - 1] * i;
	R[3030302] = inv(F[3030302]);
	for(int i = 3030301; i >= 0; --i) R[i] = R[i + 1] * (i + 1);

	if(k >= 1e7) return !(cout << 0);
	if(n == k * (k + 1) / 2) return !(cout << F[k]);

	bool c; ll p;
	if(n < k * (k + 1) / 2)
	{
		p = k - (k * (k + 1) / 2 - n);
		if(p <= 0) return !(cout << 0);
		c = true;
	}
	else
	{
		p = n - k * (k + 1) / 2;
		if(p > k) return !(cout << 0);
		c = false;
		++k;
	}

	ll g = __gcd(k, t);
	ll l = k / g;
	if(p % l) return !(cout << 0);
	p /= l;

	if(g == 1) return !(cout << 0);

	if(c)
	{
		mint ans = 0;
		for(int i = 1; i <= g; ++i) 
		{
			ans += comb(p - 1, i - 1) * comb(g - p - 1, i - 2) * mpow((INF + 1) / 2, (i - 1) * l);
			ans += comb(p - 1, i - 1) * comb(g - p - 1, i - 1) * mpow((INF + 1) / 2, i * l);
		}
		cout << ans * F[k];
	}
	else
	{
		mint ans = 0;
		for(int i = 1; i <= g; ++i)
		{
			ans += comb(p - 1, i - 1) * comb(g - p - 1, i - 1) * mpow((INF + 1) / 2, i * l - 1);
			ans += comb(p - 1, i - 1) * comb(g - p - 1, i) * mpow((INF + 1) / 2, i * l);
		}
		cout << ans * F[k - 1];
	}
}