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

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using P=pair<int,int>;
using vi=vc<int>;
const uint mod=998244353;
struct mint{
	uint v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint& s(uint vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint& operator+=(const mint&r){return s(v+r.v);}
	mint&operator-=(const mint&r){return s(v+mod-r.v);}
	mint&operator*=(const mint&r){v=(unsigned ll)v*r.v%mod;return *this;}
	mint&operator/=(const mint&r){return *this*=r.inv();}
	mint operator+(const mint&r)const{return mint(*this)+=r;}
	mint operator-(const mint&r)const{return mint(*this)-=r;}
	mint operator*(const mint&r)const{return mint(*this)*=r;}
	mint operator/(const mint&r)const{return mint(*this)/=r;}
	mint pow(ll n)const{
		if(n<0)return inv().pow(-n);
		mint res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
};

ll gcd(ll x,ll y){
	if(x==0) return y;
	return gcd(y%x,x);
}
void solve(){
	ll n,k,t;
	cin>>n>>k>>t;
	ll L=0;
	while(L*(L+1)/2<=n) L++;
	L--;
	if(k!=L&&k!=L+1){
		cout<<0<<endl;
		return;
	}
	int d=gcd(L+1,t);
	int one=(n-L*(L+1)/2);
	if(one%((L+1)/d)!=0){
		cout<<0<<endl;
		return;
	}

	vc<mint> fac(L+2),finv(L+2);
	fac[0]=finv[0]=1;
	for(int i=1;i<=L+1;i++){
		fac[i]=fac[i-1]*i;
		finv[i]=finv[i-1]/i;
	}
	auto C=[&](int a,int b)->mint{
		if(a<b) return 0;
		return fac[a]*finv[b]*finv[a-b];
	};

	vc<mint> tw(L+2);
	tw[0]=1;
	for(int i=1;i<=L+1;i++) tw[i]=tw[i-1]/2;

	one/=(L+1)/d;
	int zero=d-one;
	int s=(k==L?0:1);
	mint ret=0;
	for(int B=1;B<=d;B++){
		int z=(B+1)/2,o=B/2;
		int last=(B+1)%2;
		if(s){
			swap(z,o);
			last=1-last;
		}
		if(zero>=z&&one>=o){
			//cout<<z<<" "<<o<<endl;
			//cout<<"real "<<zero<<" "<<one<<endl;
			mint w=1;
			if(z==0){
				if(zero) continue;
			} else w*=C(zero-1,z-1);
			if(o==0){
				if(one) continue;
			} else w*=C(one-1,o-1);
			int cnt=B/2*((L+1)/d);
			if(s==0&&B%2==0) cnt--;
			//cout<<k<<" "<<cnt<<" "<<w.v<<endl;
			ret+=fac[k]*tw[cnt]*w;
		}
	}
	cout<<ret.v<<endl;
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int T=1;
	while(T--) solve();
}