#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
#include<bitset>
#include<cassert>
#include<complex>
#include<fstream>
#include<cstdlib>
#include<functional>
using namespace std;
typedef long long ll;
const int mod=998244353;
const int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
ll mypow(int x,ll n){
	if(n==0)
		return 1;
	if(n%2==1)
		return mypow(x,n-1)*x%mod;
	ll res=mypow(x,n/2);
	return res*res%mod;
}
int arr[100000];
bool used[100000];
int main(){
	int n,p,q;
	cin>>n>>p>>q;
	if(p==1&&q==1)
		cout<<1<<endl,exit(0);
	if(p==1||q==1)
		cout<<2<<endl,exit(0);
	iota(arr,arr+n,0);
	reverse(arr,arr+p);
	reverse(arr+n-q,arr+n);
	map<int,int>fact;
	for(int i=0;i<n;i++){
		if(used[i])
			continue;
		int cnt=0;
		for(int j=i;!used[j];j=arr[j],cnt++)
			used[j]=1;
		for(int j=2;j<=cnt;j++){
			int tmp=0;
			while(cnt%j==0){
				tmp++;
				cnt/=j;
			}
			fact[j]=max(fact[j],tmp);
		}
	}
	int ans=1;
	for(auto x:fact)
		ans=ans*mypow(x.first,x.second)%mod;
	cout<<ans*2%mod<<endl;
}