#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<vector>
#include<numeric>
#include<cmath>
#include<array>
#include<map>
#include<set>
#include<queue>
using namespace std;
#define ll long long
#define db double
#define ge getchar
#define pun putchar('\n')
#define pu putchar
#define puk putchar(' ')
#define pb push_back
#define hl '\n'
typedef vector<int> vint;
typedef array<int,2> pii;
const int nn=2e6+6,p=998244353,ny2=p-p/2;
ll n,k,t;

int jc[nn],ny[nn],jcn[nn],ne[nn];
int sign(int k){if(k&1)return p-1;else return 1;}
int binom(int n,int k){if(k<0)return 0;
	if(n>=0){if(k>n)return 0;
		return (ll)jc[n]*jcn[k]%p*jcn[n-k]%p;
	}return (ll)sign(k)*binom(k-n-1,k)%p;
}

int main(){
	scanf("%lld%lld%lld",&n,&k,&t);
	ll N=1,s=0;
	while(s+N<n)s+=N,N++;
	ll r=n-s; //>0
	ll T=__gcd((ll)N,t);
	
	if(k==N||k==N-1){

		jc[0]=jc[1]=ny[1]=jcn[0]=jcn[1]=1;
		for(int i=2;i<nn;i++)jc[i]=(ll)jc[i-1]*i%p,ny[i]=(ll)(p-p/i)*ny[p%i]%p,jcn[i]=(ll)ny[i]*jcn[i-1]%p;
		ne[0]=1;for(int i=1;i<nn;i++)ne[i]=(ll)ne[i-1]*ny2%p;

		int ans=0;
		ll K=N/T;
		ll y=r/K;
			
		if(r%K==0){
    		if(k==N){
    			ll sx=N/(2*K);
    			for(int x=0;x<=y&&x<=sx;x++)
    				ans=(ans+(ll)binom(y,x)*binom(T-y-1,T-y-x)%p*ne[K*x])%p;
    		}else{
    			ll sx=(N/2+1)/K-1;
    			for(int x=0;x<y&&x<=sx;x++)
    				ans=(ans+(ll)binom(y-1,x)*binom(T-y-1,T-y-x-1)%p*ne[K*(x+1)-1])%p;

    			sx=N/(2*K);
    			for(int x=0;x<=y&&x<=sx;x++)
    				ans=(ans+(ll)binom(y-1,x-1)*binom(T-y-1,T-y-x-1)%p*ne[K*x])%p;
    		}
		}
		
		ans=(ll)ans*jc[k]%p;
		printf("%d\n",ans);

	}else puts("0");

	return 0;
}