#include <stdio.h>

const int Mod = 998244353;
long long fact[200001], fact_inv[200001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	if (k < 0 || n < k) return 0;
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int N, B, W;
	scanf("%d %d %d", &N, &B, &W);
	if (B == N) {
		printf("1\n");
		fflush(stdout);
		return 0;
	}
	
	int i;
	for (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;

	int j;
	long long ans = 0;
	for (i = 0, j = N - (B + 2) - W; i <= B && j >= 0; i++, j -= 2) {
		if (i + j >= B) continue;
		ans += fact[B-1] * fact_inv[B-1-i-j] % Mod * fact_inv[i] % Mod * fact_inv[j] % Mod * combination(W + i + 1, i + 1) % Mod;
	}
	for (i = 0, j = N - (B + 1) - W; i <= B && j >= 0; i++, j -= 2) {
		if (i + j >= B) continue;
		ans += fact[B-1] * fact_inv[B-1-i-j] % Mod * fact_inv[i] % Mod * fact_inv[j] % Mod * combination(W + i, i) * 2 % Mod;
	}
	for (i = 1, j = N - B - W - 2; i <= B && j >= 0; i++, j -= 2) {
		if (i + j >= B) continue;
		ans += fact[B-1] * fact_inv[B-1-i-j] % Mod * fact_inv[i] % Mod * fact_inv[j] % Mod * combination(W + i - 1, i - 1) % Mod;
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}