#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2020202;
const int MOD = 998244353;
struct mint {
	int x;
	mint(int x) : x(x) {}
	mint() : x(0) {}
	mint operator+(int ot) const { return x + ot >= MOD ? x + ot - MOD : x + ot; }
	mint operator-(int ot) const { return x - ot < 0 ? x - ot + MOD : x - ot; }
	mint operator*(int ot) const { return 1ll * x * ot % MOD; }
	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() const { return x; }
};
mint mpow(mint a, ll x) {
	mint r = 1;
	while (x) {
		if (x & 1) r *= a;
		a *= a;
		x /= 2;
	}
	return r;
}

mint fac[MAXN], inv[MAXN];
mint binom(int n, int k) {
	if (n == k) return 1;
	if (n < k || k < 0) return 0;
	return fac[n] * inv[k] * inv[n - k];
}

ll n, k, t;
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	fac[0] = 1;
	for (int i = 1; i < MAXN; i++) fac[i] = fac[i - 1] * i;
	inv[MAXN - 1] = mpow(fac[MAXN - 1], MOD - 2);
	for (int i = MAXN - 1; i > 0; i--) inv[i - 1] = inv[i] * i;

	cin >> n >> k >> t;
	if (k > 1e9) return !(cout << 0 << '\n');
	if (t == 1) {
		if (n != k * (k + 1) / 2) {
			return !(cout << 0 << '\n');
		}
		else {
			return !(cout << fac[k] << '\n');
		}
	}
	mint ans = 0;
	if (__gcd(t, k) != 1) {
		ll T = __gcd(t, k);
		ll g = k / T;
		if (n > k * (k - 1) / 2 && n <= k * (k + 1) / 2) {
			ll a = n - k * (k - 1) / 2;
			ll b = k - a;
			if (a % g == 0 && b % g == 0) {
				a /= g;
				b /= g;

				mint s = mpow(2, MOD - 1 - g);
				mint t = 1;
				for (int x = 0; x <= min(a, b); x++) {
					ans += binom(a, x) * binom(b - 1, x - 1) * t;
					t *= s;
				}
			}
		}
	}
	if (__gcd(t, k + 1) != 1) {
		ll T = __gcd(t, k + 1);
		ll g = (k + 1) / T;
		if (n >= k * (k + 1) / 2 && n < (k + 1) * (k + 2) / 2) {
			ll b = n - k * (k + 1) / 2;
			ll a = k + 1 - b;
			if (a % g == 0 && b % g == 0) {
				a /= g;
				b /= g;

				mint s = mpow(2, MOD - 1 - g);
				mint t = 1;
				mint v = mpow(2, MOD - g);
				for (int x = 0; x <= min(a, b); x++) {
					ans += binom(a - 1, x) * binom(b - 1, x - 1) * t;
					ans += v * binom(a - 1, x) * binom(b - 1, x) * t;
					t *= s;
				}
			}
		}
	}
	cout << ans * fac[k] << '\n';
}