#pragma GCC optimize("Ofast,unroll-loops,inline")
#include<bits/stdc++.h>
using namespace std;
const int NR=1.5e7+10;
#define int long long
const int MOD=998244353;
int n,d,r,fac[NR*2],inv[NR*2],ifac[NR*2],f[NR],prime[NR],tot;
bool vis[NR];
void add(int &x,int y){x=(x+y)%MOD;}

void init(){
	for(int i=2;i<NR;i++){
		if(!vis[i])prime[++tot]=i;
		for(int j=1;j<=tot&&i*prime[j]<NR;j++){
			vis[i*prime[j]]=1;
			if(i%prime[j]==0)break;
		}
	}
}

int C(int x,int y){return fac[x]*ifac[y]%MOD*ifac[x-y]%MOD;}
signed main(){
//	freopen("count.in","r",stdin);
//	freopen("count.out","w",stdout);
	cin>>n>>d>>r;init();
	inv[1]=1;
	for(int i=2;i<=n+d;i++)inv[i]=(MOD-inv[MOD%i])*(MOD/i)%MOD;
	fac[0]=ifac[0]=1;
	for(int i=1;i<=n+d;i++)
		fac[i]=fac[i-1]*i%MOD,ifac[i]=ifac[i-1]*inv[i]%MOD;
	int ans=0;
	for(int i=1;i<=d;i++)f[i]=C(d-i+n-1,n-1);
	for(int i=1;i<=tot;i++)
		for(int j=d/prime[i];j>=1;j--)f[j]=(f[j]+f[j*prime[i]])%MOD;
	for(int i=1;i<=n;i++)
		if(i<=r)add(ans,C(n,i)*f[i]%MOD*(i==1));
		else {
			if((i-r)&1)add(ans,-C(n,i)*f[i]%MOD*C(i-2,r-1));
			else add(ans,C(n,i)*f[i]%MOD*C(i-2,r-1));
		}
//	printf("%lld\n",(ans+MOD)%MOD);
	printf("%lld\n",((ans%MOD+MOD)*ifac[n+d-1]%MOD*fac[n-1]%MOD*fac[d]%MOD+r)%MOD);
	return 0;
}