#include <bits/stdc++.h>
#include <random>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
using vvvvvvll = vector<vvvvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

ll mod = 1e9 + 7;
ll modPow(long long a, long long n, long long p = mod) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}








int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,P,Q;
    cin>>N>>P>>Q;
    if(N==1){
        cout<<1<<endl;
        return 0;
    }
    if(P==1&&Q==1){
        cout<<1<<endl;
        return 0;
    }
    if(P==1||Q==1){
        cout<<2<<endl;
        return 0;
    }
    if(P==Q&&P==N){
        cout<<2<<endl;
        return 0;
    }
    if(N>=P+Q){
        cout<<4<<endl;
        return 0;
    }
    vll R(N);
    rep(i,N)R[i]=i;
    vll NR=R;
    rep(i,P){
        NR[i]=R[P-i-1];
    }
    
    R=NR;
    //rep(i,N)cout<<R[i]<<endl;
    reverse(all(R));
    NR=R;
    rep(i,Q){
        NR[i]=R[Q-i-1];
    }
    R=NR;
    reverse(all(R));
    //cout<<endl;
    //rep(i,N)cout<<R[i]<<endl;
    map<ll,ll> M;
    vb seen(N,false);
    ll an=1;
    ll mod=998244353;
    vll aP;
    rep(i,N){
        if(!seen[i]){
            ll x=R[i];
            ll k=1;
            while(x!=i){
                seen[x]=1;
                x=R[x];
                k++;
            }

            for(ll j=2;j*j<=k;j++){
                if(k%j==0){
                    ll np=j;
                    ll nk=0;
                    while(k%j==0){
                        k/=j;
                        nk++;
                    }
                    M[j]=max(M[j],nk);
                }
            }
            if(k!=0&&!M.count(k))M[k]=1;
            
        }
    }
    for(auto p:M){
        rep(i,p.second){
            an*=p.first;
            an%=mod;
        }
    }
    
    cout<<(an*2)%mod<<endl;
}