#include<bits/stdc++.h>
using namespace std;
long long read(){
	long long ret=0,neg=1;
	char c;
	c=getchar();
	while((c<'0'||c>'9')&&c!='-'){
		c=getchar();
	}
	if(c=='-'){
		neg=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		ret=(ret<<1)+(ret<<3)+c-'0';
		c=getchar();
	}
	return ret*neg;
}
void write(long long x){
	if(x<0){
		x=-x;
		putchar('-');
	}
	if(x>=10) write(x/10);
	putchar((x%10)+'0');
}
const long long mod=998244353;
int fac[31000000],fic[31000000];
inline long long ksm(long long x,long long t){
	long long ret=1;
	while(t){
		if(t&1){
			ret=ret*x%mod;
		}
		x=x*x%mod;
		t>>=1;
	}
	return ret;
}
inline void Pre(){
	fac[0]=1;
	for(int i=1;i<=30100000;++i){
		fac[i]=1ll*fac[i-1]*i%mod;
	}
	fic[30100000]=ksm(fac[30100000],mod-2);
	for(int i=30100000-1;i>=0;--i){
		fic[i]=1ll*fic[i+1]*(i+1)%mod;
	}
	assert(fic[0]==1);
}
inline long long C(int x,int y){
	if(x<0||y<0||y>x) return 0;
	return 1ll*fac[x]*fic[y]%mod*fic[x-y]%mod;
}
int n,D,r;
int f[16000000];
bitset<16000000> vis;
inline void Get_f(){
	f[0]=1ll*D*C(D+n-1,n-1)%mod;
	for(int i=1;i<=D;++i)
		f[i]=C(D-i+n-1,n-1);
	for(int i=2;i<=D;++i){
		if(vis[i]==false){
			for(int j=(D/i);j;--j){
				vis[i*j]=true;
				f[j]=(f[j]+f[i*j])%mod;
			}
		}
	}
}
int main(){
	Pre();
	n=read();
	D=read();
	r=read();
	Get_f();
	int ans=0;
	for(int j=0;j<=n;++j){
		int tmp;
		if((j+r)&1) tmp=mod-1;
		else tmp=1;
		tmp=1ll*tmp*C(n,j)%mod*f[j]%mod*C(j-2,r-1)%mod;
		ans=(ans+tmp)%mod;
	}
	ans=1ll*ans*fac[D]%mod*fac[n-1]%mod*fic[n+D-1]%mod;
	ans+=r+D;
	ans%=mod;
	write(ans);
	return 0;
}