#include <iostream>

using namespace std;
using ll = long long;
const int MX = 100010;
ll f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

ll pw(ll a,ll x){
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        (a *= a) %= mod; x /= 2;
    }
    return ret;
}

int main(){
    int i,n,m,k; cin >> n >> m >> k;
    solve();
    if(m + k>=n){
        ll d = m + k - n;
        ll a = m - d,b = k - d;
        ll ans = 0;
        for(i=0;i<=min(a,b);i++) (ans += nck(a,i)*nck(b,i)%mod*f[i]%mod) %= mod;
        cout << ans << endl; 
    }else{
        ll ans = 0;
        for(i=0;i<=min(m,k);i++) (ans += nck(m,i)*nck(k,i)%mod*f[i]%mod) %= mod;
        ll d = m + k;
        for(i=d + 1;i<=n;i++) (ans *= i) %= mod;
        cout << ans << endl;
    }
}