#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, b, w;
  cin >> n >> b >> w;
  if (b == n) {
    cout << 1 << '\n';
    return 0;
  }
  mint ans;
  int x = w - (n - 3 * b);
  for(int c2 = 0;; c2++) {
    int c1 = x - 2 * c2;
    if (c1 < 0) break;
    rep(s, 4) {
      mint cnt = 1;
      int r1 = 2, r2 = b - 1;
      int p = c1, q = c2;
      rep(i, 2) if (s >> i & 1) {
        r1--;
        p--;
      }
      if (p < 0) continue;
      if (p > r2) continue;
      cnt *= comb(r2, p);
      r2 -= p;
      if (r2 < q) continue;
      cnt *= comb(r2, q);
      r2 -= q;
      int r = r1 + r2;
      int rest = n + 3 - 2 * c1 - c2 - 3 * r;
      cnt *= comb(rest + r - 1, rest);
      ans += cnt;
    }
  }
  cout << ans.val() << '\n';
}