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


int main() {	
	
	int N,p,q;
	cin>>N>>p>>q;
	int n = N;
	mint ans = 0;
	if(p==1&&q==1)ans = 1;
	else if(p==1)ans = 2;
	else if(q==1)ans = 2;
	else if(p+q<=N)ans = 4;
	else{
		vector<int> x(n);
		rep(i,n)x[i] = i;
		reverse(x.begin(),x.begin()+p);
		reverse(x.rbegin(),x.rbegin()+q);
		
		dsu D(n);
		rep(i,n)D.merge(i,x[i]);
		mint cur = 1;
		auto g = D.groups();
		map<int,int> mp;
		rep(i,g.size()){
			int nn = g[i].size();
			for(int j=2;j*j<=n;j++){
				if(nn%j==0){
					int cnt = 0;
					while(nn%j==0){
						nn /= j;
						cnt++;
					}
					mp[j] = max(mp[j],cnt);
				}
			}
			if(nn!=1)mp[nn] = max(mp[nn],1);
			
		}
		for(auto a:mp){
			cur *= mint(a.first).pow(a.second);
		}
		ans= cur*2;
		
	}
	cout<<ans.val()<<endl;
	
    return 0;
}