#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mod = 998244353, N = 3e7 + 5;
int fac[N], inv[N], f[N], g[N];
int prime[N], cnt;
bool ntp[N];
int qpow(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % mod;
		x = (ll)x * x % mod;
		y >>= 1;
	}
	return ans;
}
void prep(int n)
{
	int i;
	fac[0] = 1;
	for(i = 1; i <= n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n], mod - 2);
	for(i = n; i >= 1; i--)
		inv[i - 1] = (ll)inv[i] * i % mod;
}
int C(int x, int y)
{
	return (x < y || y < 0) ? 0 : ((ll)fac[x] * inv[y] % mod * inv[x - y] % mod);
}
void sieve(int n)
{
	int i, j;
	for(i = 2; i <= n; i++)
	{
		if(!ntp[i])
			prime[++cnt] = i;
		for(j = 1; j <= cnt && i * prime[j] <= n; j++)
		{
			ntp[i * prime[j]] = 1;
			if(!(i % prime[j]))
				break;
		}
	}
}
void work(int n)
{
	int i, j;
	for(i = 1; i <= cnt; i++)
		for(j = n / prime[i]; j >= 1; j--)
			f[j] = (f[j] + f[j * prime[i]]) % mod;
}

int main()
{
	int n, d, r, i, j, ans = 0, tmp;
	prep(3e7);
	sieve(1.5e7);
	scanf("%d%d%d", &n, &d, &r);
	for(i = 1; i <= n; i++)
	{
		g[i] = ((ll)i * C(i - 2, r - 2) + mod - (ll)r * C(i - 1, r - 1) % mod) % mod;
		if((i + r - 1) & 1)
			g[i] = mod - g[i];
	}
	g[1] = 1;
	for(i = 1; i <= d; i++)
		f[i] = C(d - i + n - 1, n - 1);
	work(d);
	for(i = 1; i <= n; i++)
	{
		tmp = (C(d + n - 1, n - 1) + f[i]) % mod;
		ans = (ans + (ll)C(n, i) * tmp % mod * g[i]) % mod;
	}
	ans = (ll)ans * qpow(C(d + n - 1, n - 1), mod - 2) % mod;
	printf("%d\n", ans);
	return 0;
}
/*
15000000 15000000 1031
*/