#include<bits/stdc++.h>
#define int long long
#define MOD 998244353
using namespace std;
int n,m,k,jc[5000003],njc[5000003],ans;
int fstp(int X,int Y){int ret=1,bse=X%MOD;while(Y){if(Y%2)ret=ret*bse%MOD;bse=bse*bse%MOD;Y/=2;}return ret;}
int C(int X,int Y){if(X<0||Y<0||X<Y)return 0;return jc[X]*(njc[Y]*njc[X-Y]%MOD)%MOD;}
int calc(int A,int B){
	if(A<0)return 0;
	if(B==0)return (A==0);
	int ret=0;
	ret=(C(2*A+B-1,A)-C(2*A+B-1,A-1))%MOD;
	return ret;
}
int f(int X){return C(2*X,X)*fstp(X+1,MOD-2)%MOD;}
signed main(){
	ios::sync_with_stdio(false);
	jc[0]=1;
	for(int i=1;i<=5000000;i++)jc[i]=jc[i-1]*i%MOD;
	njc[5000000]=fstp(jc[5000000],MOD-2);
	for(int i=4999999;i>=0;i--)njc[i]=njc[i+1]*(i+1)%MOD;
	cin>>n>>m>>k;
	for(int i=0;i<=n;i++){
		if(i%2==0)ans=(ans+(fstp(f(k),i)*calc(m-i*k,n-i)%MOD)*C(n,i))%MOD;
		else ans=(ans-(fstp(f(k),i)*calc(m-i*k,n-i)%MOD)*C(n,i))%MOD;
	}
	ans%=MOD;
	ans+=MOD;
	ans%=MOD;
	cout<<ans;
	return 0;
}