#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=3e7+1;
const int iu=3e7;
const ll mod=998244353;
ll n,d,r;
ll f[N],inf[N];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
ll C(ll x,ll y){
	if(y>x || y<0) return 0;
	return f[x]*inf[y]%mod*inf[x-y]%mod;
}
ll frog[N];//expected value of min(c1,...,ck)
ll save[N];
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> n >> d >> r;
	f[0]=1;
	for(int i=1; i<=iu ;i++) f[i]=f[i-1]*i%mod;
	inf[iu]=pw(f[iu],mod-2);
	for(int i=iu; i>=1 ;i--) inf[i-1]=inf[i]*i%mod;
	ll ans=d+r;
	for(int j=1; j<=d ;j++) save[j]=C(n-1+d-j,n-1);
	for(int i=n; i>=1 ;i--){
		for(int r=1; r*i<=d ;r++){
			frog[i]=frog[i]+save[r*i];
		}
		frog[i]%=mod;
		frog[i]=frog[i]*f[d]%mod*f[n-1]%mod*inf[n+d-1]%mod;
		/*cout << frog[i] << ' ';
		cout << endl;*/
		ll ways=frog[i]*C(n,i)%mod;
		ll co=C(i-2,r-1);
		if(i%2!=r%2) co=(mod-co)%mod;
		ans=(ans+co*ways)%mod;
	}
	cout << ans << '\n';
}