#include<bits/stdc++.h>
using namespace std;
const int N = 2e7+5;
typedef long long ll;
const int mod = 998244353;
inline int add(int a,int b){a+=b;return a>=mod?a-mod:a;}
inline int sub(int a,int b){a-=b;return a<0?a+mod:a;}
inline int mul(int a,int b){return 1ll*a*b%mod;}
inline int qpow(int a,int b){int ret=1;for(;b;b>>=1,a=mul(a,a))if(b&1)ret=mul(ret,a);return ret;}
/* math */
int n,a,b;
int fac[N], ifac[N];
inline void init(int n = 2e7){
	fac[0] = ifac[0] = 1;for(int i=1;i<=n;i++)fac[i] = mul(fac[i-1], i);
	ifac[n] = qpow(fac[n], mod-2);for(int i=n-1;i;i--)ifac[i] = mul(ifac[i+1],i+1);
}
inline int binom(int a,int b){
	if(b>a)return 0;
	if(b==a)return 1;
	if(b<0)return 0;
	return mul(fac[a],mul(ifac[b],ifac[a-b]));
}

int main()
{
	init();
	cin >> n >> b >> a;
	int ans = 0;
	for(int j=0;j<=b;j++){
		int buc = a-j-(a-b), rest = n-a-j;
		if(rest < 0 || buc < 0)continue;
		if(rest == 0 && buc > 0)continue;
		// cout << a << " " << j << endl;
		int sum = sub(binom(a+j-1,j),binom(a+j-1,a));
		if(j==0 && a==0)sum = 1;
		int w = binom(buc+rest-1,rest-1);
		ans = add(ans, mul(sum,w));
	}
	cout << ans << endl;
}