#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main() {
    
	int N,B,W;
	cin>>N>>B>>W;
	combi C(1000000);
	mint ans = 0;
	rep(i,2){
		rep(j,2){
			for(int k=0;k<=B-1;k++){
				
				int r = N-B;
				r -= i;
				r -= j;
				r -= k*2;				
				r -= W;
				
				if(r<0)continue;
				
				if(B-1-k<r)continue;
				
				mint t = C.combination(B-1-k,r);
				t *= C.combination(B-1,k);
				int X = W;
				int Y = i + j + k;
				if(X==0&&Y==0){
				}
				else if(Y!=0){
					t *= C.junretsu(X,Y-1);
				}
				else t = 0;
				//cout<<i<<','<<j<<','<<k<<','<<t.val()<<endl;
				ans += t;
			}
		}
	}
	
	cout<<ans.val()<<endl;
	
    return 0;
}