#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,s,t;int h;
const int mod=998244353,inv2=(mod+1)/2;
int qpow(int a,int b){
	int c=1;
	for(;b;b>>=1){
		if(b&1)c=1ll*a*c%mod;
		a=1ll*a*a%mod;
	}
	return c;
}
const int N=1e7;
int jc[10010000],ij[10100000],i2[10100000];
void sieve(){
	jc[0]=i2[0]=1;
	for(int i=1;i<=N;i++)jc[i]=1ll*i*jc[i-1]%mod,i2[i]=1ll*inv2*i2[i-1]%mod;
	ij[N]=qpow(jc[N],mod-2);
	for(int i=N;i;i--)ij[i-1]=1ll*i*ij[i]%mod;
}
int C(int a,int b){if(a<b)return 0;return 1ll*jc[a]*ij[b]%mod*ij[a-b]%mod;}
int P(int a,int b){return C(a-1,b-1);}
int main(){
	sieve();
	scanf("%lld%lld%lld",&s,&n,&t);
	ll zg=0;h=0;
	while(zg<s)h++,zg+=h;
	if(zg==s){puts((n==h)?"1":"0");return 0;}
	zg-=h,s-=zg;
	t=__gcd(t,1ll*h);
	if(h!=n&&h-1!=n){puts("0");return 0;}
	if(s%(h/t)){puts("0");return 0;}
	s/=(h/t);//长度为t的周期，每个周期需有s个1
	if(s>t){puts("0");return 0;}
	int ans=0;
	for(int l=0;l<2;l++)if(l==((h-n)^1)){
		for(int o=2;o<=t;o++){
			if(l)(ans+=1ll*P(s,(o+1)/2)*P(t-s,o/2)%mod*i2[(h/t)*(o/2)]%mod)%=mod;
			else{
				if(o&1)(ans+=1ll*P(s,o/2)*P(t-s,(o+1)/2)%mod*i2[(h/t)*(o/2)]%mod)%=mod;
				else (ans+=1ll*P(s,o/2)*P(t-s,(o+1)/2)%mod*i2[(h/t)*(o/2)-1]%mod)%=mod;
			}
		}
	}
	return printf("%lld",(1ll*ans*jc[n]%mod+mod)%mod),0;
}