#include <bits/stdc++.h>
#define N 30000011
using namespace std;
int n,d,r,fac[N],ifac[N],R[N],F[N];const int p=998244353;
inline int qpow(int bs,int ex){int ans=1;while(ex){if(ex&1)ans=1ll*ans*bs%p;ex>>=1;bs=1ll*bs*bs%p;}return ans;}
inline int binom(int n,int m){if(n<m||m<0)return 0;return 1ll*fac[n]*ifac[m]%p*ifac[n-m]%p;}
int Sn(int n,int m)
{
	if(m<0)return 0;
	if(!n)return 1;
	return m&1?-binom(n-1,m):binom(n-1,m);
}
bool is[N];int pr[N/10];
int main()
{
	scanf("%d%d%d",&n,&d,&r);
	if(!d){printf("%d\n",r);return 0;}
	fac[0]=1;for(int i=1;i<N;++i)fac[i]=1ll*fac[i-1]*i%p;
	ifac[N-1]=qpow(fac[N-1],p-2);for(int i=N-2;~i;--i)ifac[i]=1ll*ifac[i+1]*(i+1)%p;
	int ans=0;
	for(int j=1;j<=d;++j)
	{
		R[j]=(j&1?-1:1)*(1ll*j*-Sn(j-1,r-1)+1ll*r*-Sn(j,r))%p*binom(n,j)%p;
	}
	for(int j=1;j<=d;++j)F[j]=binom(n+d-1-j,n-1);
	is[0]=is[1]=1;
	for(int i=2;i<=d;++i)
	{
		if(!is[i])pr[++pr[0]]=i;
		for(int j=1;j<=pr[0]&&i*pr[j]<=d;++j)
		{
			is[i*pr[j]]=1;
			if(i%pr[j]==0)break;
		}
	}
	for(int i=1;i<=pr[0];++i)
	{
		for(int j=d/pr[i];j;--j)
		{
			F[j]=(F[j]+F[j*pr[i]])%p;
		}
	}
	for(int j=1;j<=d;++j)ans=(ans+1ll*F[j]*R[j])%p;
	int denom=binom(n+d-1,n-1);
	printf("%d\n",(1ll*ans*qpow(denom,p-2)%p+r+p)%p);
	fclose(stdin);fclose(stdout);return 0;
}