#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e6+5,mod=998244353;
int n,m,k;ll ans,fac[N],inv[N],Inv[N+N];
inline ll qpow(ll a,ll b){ll ans=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ans=ans*a%mod;return ans;}
inline void precalc(int n){
	fac[0]=1;for(int i=1;i<=n;++i)fac[i]=fac[i-1]*i%mod;
	inv[n]=qpow(fac[n],mod-2);for(int i=n-1;~i;--i)inv[i]=(i+1)*inv[i+1]%mod;
	Inv[0]=Inv[1]=1;for(int i=2;i<=n;++i)Inv[i]=(mod-mod/i)*Inv[mod%i]%mod;
}
inline ll C(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}
inline ll F(int n,int m){
	if(m==0)return 1;
	if(n==0)return 0;
	return C(2*m+n-1,m)*Inv[m+n]%mod*n%mod;
}
int main(){
	precalc(3e6);
	scanf("%d%d%d",&n,&m,&k);
	for(int i=0;i<=n;++i)
    	if(1ll*i*k<=m){
			ll coef;
			coef=C(n,i)*qpow(F(1,k),i)%mod*F(n-i,m-i*k)%mod;
			if(i&1)ans=(ans-coef+mod)%mod;
			else (ans+=coef)%=mod;
		}
	return printf("%lld\n",ans),0;
}