// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

const int mod = 998244353;

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} com(10000005);

int main(){
    int n,b,w; cin>>n>>b>>w;

    mint ans = 0;

    rep(one,n-b+1-w){
        if ((n-b-one-w)%2 ==1) continue;
        int two = (n-b - one - w) / 2;

        if (one + two > b+1) continue;

        // deb(one , two);

        // assert(n+1-one >= two);

        // show(com(w + two-1 , w).val());
        // show(com(b-1 , one).val());
        // show(com(b-1-one , two).val());

        if (w == 0 && two == 0) ans += com(b-1 , one) * com(b-1-one , two);
        else ans += com(w + two-1 , w) * com(b-1 , one) * com(b-1-one , two);
        // show(ans.val());
    }

    mint tmp = 0;

    rep(one,n-b+1-w){
        if ((n-b-one-w+1)%2 == 1) continue;
        int two = (n-b - one - w + 1) / 2;

        if (one + two > b+1) continue;

        // deb(one , two);

        // assert(n+1-one >= two);

        tmp += com(w + two-1 , w) * com(b-1 , one) * com(b-1-one , two-1);
        // show(tmp.val());
    }

    ans += tmp * 2;

    tmp = 0;

    rep(one,n-b+1-w){
        if ((n-b-one-w+2)%2 == 1) continue;
        int two = (n-b - one - w + 2) / 2;

        if (one + two > b+1) continue;

        // deb(one , two);

        // assert(n+1-one >= two);

        tmp += com(w + two-1 , w) * com(b-1 , one) * com(b-1-one , two-2);

        // show(tmp.val());
    }

    ans += tmp;

    cout << ans.val() << endl;

// 消せ！！！！！！　#define _GLIBCXX_DEBUG
// priority_queue でしぬ

    return 0;
}