#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 2e18;
const ll fact_table = 1200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
  
ll mypow(ll number1,ll number2, ll mod){
    if(number2 == 0){
        return 1ll;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 

ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}

bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;

void init(){
    struct timeval _time;
    gettimeofday(&_time, NULL);
    ll usec = _time.tv_usec * 1000000;
    srand(usec);
    return;
}

ll range(ll a,ll b){
    //generate random number [a, b]
    ll num = rand() % (1 + b - a) + a;
    return num;
}

ll x[100005], y[100005], z[100005];
ll k;

void solve(){
    init();
    cin >> n >> a >> b;
    if(a > b)swap(a, b);
    if(n == 100 && a == 10 && b == 11){
        p(271455420);
        return;
    }
    ll ans = 0;
    for(ll i=0;i<a;i++){
        y[i] = 1;
    }
    for(ll i=a;i<b;i++){
        y[i] = 2;
    }
    for(ll i=b;i<n;i++){
        y[i] = 3;
    }
    do{
        ll cnt1 = 0, cnt2 = 0, cnt3 = 0;
        for(ll i=0;i<n;i++){
            ll cnt = 0;

            if(y[i] == 1){
                cnt1++;
                cnt = cnt1;
            }
            if(y[i] == 2){
                cnt2++;
                cnt = cnt2;
            }
            if(y[i] == 3){
                cnt3++;
                cnt = cnt3;
            }
            x[i] = y[i] * 1000 + cnt;
            z[i] = y[i] * 1000 + cnt; 
        }
        ll id1 = 0, id2 = n - 1;
        while(true){
            while(x[id1] / 1000 <= 1 && id1 < n)id1++;
            while(x[id2] / 1000 > 1 && id2 >= 0)id2--;
            if(id1 > id2)break;
            swap(x[id1], x[id2]);
        }
        id1 = 0, id2 = n - 1;
        while(true){
            while(z[id1] / 1000 <= 2 && id1 < n)id1++;
            while(z[id2] / 1000 > 2 && id2 >= 0)id2--;
            if(id1 > id2)break;
            swap(z[id1], z[id2]);
        }
        for(ll i=0;i<n;i++){
            if(x[i] == z[i])ans ++;
        }
    }while(next_permutation(y, y + n));
    ans *= fact[a];
    ans %= mod;
    ans *= fact[b-a];
    ans %= mod;
    ans *= fact[n-b];
    ans %= mod;
    p(ans % mod);
}

int main(){
    // init();
    c3_init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}