#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <ctime>
#include <random>
#include <cassert>
#include <numeric>
#include <cmath>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#define pii pair<int, int>
#define fi first
#define se second
#define MP make_pair
#define ep emplace
#define eb emplace_back
#define int long long
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (j); i >= (k); i--)
typedef double db;
typedef long double ldb;
typedef long long ll;
//typedef __int128 lll;
typedef unsigned long long ull;
typedef unsigned int ui;
using namespace std;
using namespace __gnu_pbds;
bool Mbe;

//char buf[1<<20],*p1,*p2;
//#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
int read() {
	int s = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
	return f ? s : -s;
}
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(x>y)x=y;}

const int N=3000005,mod=998244353;
int fpow(int x,int k=mod-2){
	int res=1;
	for(;k;k>>=1){
		if(k&1)res=res*x%mod;
		x=x*x%mod; 
	}
	return res;
}
int fac[N],ifac[N],ans;
int C(int x,int y){return x<y?0:fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
int get(int n,int m){
	if(!m)return 1;
	return (C(n+m+m-1,m)-C(n+m+m-1,m+n)+mod)%mod;
}

signed main() {
	int n=read(),m=read(),k=read();
	fac[0]=1;
	rep(i,1,3000000)fac[i]=fac[i-1]*i%mod;
	ifac[3000000]=fpow(fac[3000000]);
	per(i,3000000,1)ifac[i-1]=ifac[i]*i%mod;
	int coef=C(k+k,k)*ifac[k+1]%mod*fac[k]%mod,now=1;
	rep(i,0,min(m/k,n)){
		ans=(ans+((i&1)?-1:1)*get(n-i,m-i*k)*C(n,i)%mod*now%mod+mod)%mod;
		now=now*coef%mod;
	}
	printf("%lld\n",ans);
	return 0;
}