#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main() {
    COMinit();
    int N,B,W;
    cin >> N >> B >> W;
    int ans = 0;
    for(int i = 1; i <= B; i++) {
        if(B+2*i <= N-W && N-W-(B+2*i) <= B-i) {
            int res = N-W-(B+2*i);
            ans += COM(res+i-1,i-1)*COM(W+i,i)%mod*COM(B-1,i+res-1)%mod;
            if(ans >= mod) ans -= mod;
        }
        if(B+2*i-1 <= N-W && N-W-(B+2*i-1) <= B-i) {
            int res = N-W-(B+2*i-1);
            ans += COM(res+i-1,i-1)*COM(W+i-1,i-1)*2%mod*COM(B-1,i+res-1)%mod;;
            if(ans >= mod) ans -= mod;
        }
        if(B+2*i-2 <= N-W && N-W-(B+2*i-2) <= B-i) {
            int res = N-W-(B+2*i-2);
            ans += COM(res+i-1,i-1)*((i == 1)?((W == 0)?1:0):COM(W+i-2,i-2))%mod*COM(B-1,i+res-1)%mod;;
            if(ans >= mod) ans -= mod;
        }
    }
    cout << ans << endl;
}