#include<bits/stdc++.h>
#define ll long long
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=2e6+10,mod=998244353;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }return sum;
}
int n,k,t;
int f[Maxn];
int g[Maxn];
int fac[Maxn],ifac[Maxn];
inline int C(int x,int y){if(x<y || x<0 || y<0) return 0;return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
inline void into(int N){
    fac[0]=ifac[0]=1;
    fr(i,1,N) fac[i]=fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N]);
    rf(i,N-1,1) ifac[i]=ifac[i+1]*(i+1)%mod;
}
inline void init(){
    n=read();k=read();t=read();
    into(2e6);
}
int ans;
const int inv2=ksm(2);
inline int gcd(int x,int y){if(y==0) return x;return gcd(y,x%y);}
inline int getv(int x,int y){return C(x-1,y-1);}
inline int getans(int x,int y){
    if(x>=2e6) return 0;
    // cout<<n<<' '<<x<<' '<<y<<endl;
    if(n<x*(x+1)/2) return 0;
    // cout<<"**"<<(x+1)*(x+2)/2<<endl;
    if(n>(x+1)*(x+2)/2) return 0;
    int s=n-x*(x+1)/2;
    int ggcd=gcd(x+1,t);
    // cout<<s<<' '<<ggcd<<endl;
    if(s%((x+1)/ggcd)!=0) return 0;
    int s1=s/((x+1)/ggcd),s2=ggcd;
    if(s1==0) return fac[k];
    // cout<<s2<<' '<<s1<<' '<<x<<endl;
	int ans=0;
    fr(tp,0,1) if(tp==(y)){
        fr(i,2,s2){
            if(tp){
                int now=getv(s1,(i+1)/2)*getv(s2-s1,i/2)%mod;
                // cout<<"**"<<s1<<' '<<(i+1)/2<<' '<<(x+1)/s2*(i/2)<<' '<<now<<endl;
                now=now*ksm(inv2,(x+1)/s2*(i/2))%mod;
                add(ans,now);
            }
            else {
                if(i&1){
                    int now=getv(s1,(i)/2)*getv(s2-s1,(i+1)/2)%mod;
                    now=now*ksm(inv2,(x+1)/s2*(i/2))%mod;
                    add(ans,now);
                }
                else {
                    int now=getv(s1,(i)/2)*getv(s2-s1,(i+1)/2)%mod;
                    now=now*ksm(inv2,(x+1)/s2*(i/2)-1)%mod;
                    add(ans,now);
                }
            }
            // cout<<tp<<' '<<i<<' '<<ans<<endl;
		}
	}
    return 1ll*ans*fac[k]%mod;
}
inline void work(){
    ans=(getans(k,0)+getans(k-1,1))%mod;
    writeln(ans);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}