// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) ((x)&(-(x)))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
void fre(){
}
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int maxn=30000005;
const int mod=998244353;
inline int qpow(int x,ll y){ int res=1; for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)res=1ll*res*x%mod; return res; }
inline void inc(int &x,const int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
inline void dec(int &x,const int y){ x=(x>=y)?(x-y):(x+mod-y); }
inline void mul(int &x,const int y){ x=1ll*x*y%mod; }
inline int add(const int x,const int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
inline int sub(const int x,const int y){ return (x>=y)?(x-y):(x+mod-y); }
inline int prod(const int x,const int y){ return 1ll*x*y%mod; }
#define norm Fast_mod.Fresh
#define ulll __uint128_t
struct FastMod{ull p,w;FastMod(ull p=2):p(p),w((ull)(((ulll)(1)<<64)/p)){}ull Fresh(ull x){ull d=(ull)(((ulll)(w)*x)>>64),r=x-p*d;return r>=p?r-p:r;}}Fast_mod;
namespace combi{
	int fac[maxn],ifac[maxn];
	void init(const int N){
		fac[0]=ifac[0]=1;
		F(i,1,N)fac[i]=norm(1ll*fac[i-1]*i);
		ifac[N]=qpow(fac[N],mod-2);
		dF(i,N-1,1)ifac[i]=norm(1ll*ifac[i+1]*(i+1));
	}
	inline int C(const int n,const int m){
		if(m>n||n<0||m<0)return 0;
		return norm(norm(1ll*fac[n]*ifac[m])*ifac[n-m]);
	}
}
using namespace combi;
int n,m,k;
inline int f(int n,int m){
	if(!n)return (m==0);
	return sub(C((m<<1)+n-1,m),C((m<<1)+n-1,m-1));
}
void solve(){
	cin>>n>>m>>k,Fast_mod=FastMod(mod),init(maxn-3); const int p=f(1,k);
	int coef=1,ans=0;
	F(i,0,min(m/k,n)){
		if(!(i&1))inc(ans,norm(1ll*norm(1ll*C(n,i)*f(n-i,m-i*k))*coef));
		else dec(ans,norm(1ll*norm(1ll*C(n,i)*f(n-i,m-i*k))*coef));
		coef=norm(1ll*coef*p);
	} cout<<ans;
}
signed main(){
	fre(),ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}