// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 2000005
#define inf 0x3f3f3f3f

int n,k,t;
modint pw[maxn];

void solve(int n,int s,int op)
{
	// t : cir
	// n/t : duanshu
	cerr<<"solve "<<n<<" "<<s<<" "<<t<<" "<<op<<"\n";
	if(s%(n/t)!=0){
		puts("0");
		exit(0);
	}
	if(t==1){
		puts("0");
		exit(0);
	}
	s/=(n/t);
	int s0=t-s;
	int s1=s;
//	cout<<"s0,s1 "<<s0<<" "<<s1<<"\n";
	modint res=0;
	if(op==1){
		For(i,1,s0){
			modint tmp=(C(s1-1,i)+C(s1-1,i-1));
			tmp*=C(s0-1,i-1);
			res+=tmp*pw[i*(n/t)];
		}
	//	res=C(t-1,s0)*qpow((mod+1)/2,s0*(n/t));
		res*=fac[n];
	}else{
	//	res+=C(t-2,s0-2)*qpow((mod+1)/2,s*(n/t));
	//	res+=C(t-1,s0-1)*qpow((mod+1)/2,s*(n/t)-1);
	
		// 0xxxx0
		For(i,2,s0){
			modint tmp=C(s0-1,i-1)*C(s1-1,i-2);
			res+=tmp*pw[(i-1)*(n/t)];
		}
		// 0xxxx1
		For(i,1,s0){
			modint tmp=C(s0-1,i-1)*C(s1-1,i-1);
		//	cout<<"i: "<<i<<" "<<tmp.x<<"\n";
			res+=tmp*pw[i*(n/t)-1];
		}
		
		res*=fac[n-1];
	}
	cout<<res.x;
}

signed main()
{
	n=read(),k=read(),t=read();
	pw[0]=1;
	For(i,1,2000000) pw[i]=pw[i-1]*((mod+1)/2);
	initC(2e6);
	int tlen=0;
	For(i,1,2000000){
		if(1ll*i*(i+1)/2==n){
			if(i==k)cout<<fac[k].x;
			else cout<<0;
			exit(0);
		}
		if(1ll*i*(i+1)/2>n){
			tlen=i;
			if(tlen!=k && tlen!=k+1){
				puts("0");
				exit(0);
			}
			break;
		}
	}
	t%=tlen;
	t=__gcd(t,tlen);
	int sum=n-1ll*tlen*(tlen-1)/2;
	if(tlen==k) solve(tlen,sum,1);
	if(tlen==k+1) solve(tlen,sum,0);
	return 0;
}
/*

*/