Problem:
Score : 2200 points

Problem Statement

We have two indistinguishable pieces placed on a number line.
Both pieces are initially at coordinate 0. (They can occupy the same position.)

We can do the following two kinds of operations:

Choose a piece and move it to the right (the positive direction) by 1.

Move the piece with the smaller coordinate to the position of the piece with the greater coordinate.
If two pieces already occupy the same position, nothing happens, but it still counts as doing one operation.

We want to do a total of N operations of these kinds in some order so that one of the pieces will be at coordinate A and the other at coordinate B.
Find the number of ways to move the pieces to achieve it.
The answer can be enormous, so compute the count modulo 998244353.

Two ways to move the pieces are considered different if and only if there exists an integer i (1 \leq i \leq N) such that the set of the coordinates occupied by the pieces after the i-th operation is different in those two ways.

Constraints

1 \leq N \leq 10^7

0 \leq A \leq B \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the number of ways to move the pieces to achieve our objective, modulo 998244353.

Sample Input 1

5 1 3

Sample Output 1

4

Shown below are the four ways to move the pieces, where (x,y) represents the state where the two pieces are at coordinates x and y.

(0,0)→(0,0)→(0,1)→(0,2)→(0,3)→(1,3)

(0,0)→(0,0)→(0,1)→(0,2)→(1,2)→(1,3)

(0,0)→(0,0)→(0,1)→(1,1)→(1,2)→(1,3)

(0,0)→(0,1)→(1,1)→(1,1)→(1,2)→(1,3)

Sample Input 2

10 0 0

Sample Output 2

1

Sample Input 3

10 4 6

Sample Output 3

197

Sample Input 4

1000000 100000 200000

Sample Output 4

758840509

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
#define int long long
#define fr(i,a,b) for(int i(a),end##i(b);i<=end##i;i++)
#define fd(i,a,b) for(int i(a),end##i(b);i>=end##i;i--)
using namespace std;
const int mod=998244353;
const int maxn=4e7+5;
int ksm(int x,int k){
	int ans=1;
	while(k){
		if(k&1)ans=ans*x%mod;
		x=x*x%mod;
		k>>=1;
	}
	return ans;
}
int jc[maxn],inv[maxn];
void init(int n){
	jc[0]=1;
	fr(i,1,n)jc[i]=jc[i-1]*i%mod;
	inv[n]=ksm(jc[n],mod-2);
	fd(i,n-1,0)inv[i]=inv[i+1]*(i+1)%mod;
}
int C(int n,int m){
	if(n<0||m<0||n<m)return 0;
	return jc[n]*inv[m]%mod*inv[n-m]%mod;
}
int D(int n,int m){
	if(n<0||n+m<0||((n+m)&1))return 0;
	return C(n,n+m>>1);	
}
int x,y,t,ans;
signed main(){
#ifdef pig
	freopen("f.in","r",stdin);
	freopen("f.out","w",stdout);
#endif
	cin>>t>>y>>x;
	if(!x&&!y&&t){
		cout<<1;
		return 0;
	}
	init(3e7);y=x-y;
	if(2*x-t-y==0)ans=D(t-1,2*x-t-1)-D(t-1,2*x-t+1);
	fr(k,1,2*x-y){	
		int h=2*x-k-y;
		(ans+=C(h+t-k-1,h)*(D(k-1,2*x-k-1)-D(k-1,2*x-k+1)))%=mod;	
	}
	cout<<(ans+mod)%mod;
	return 0;
}