Problem: Japate, while traveling through the forest of Mala, saw N bags of gold lying in a row. Each bag has some distinct weight of gold between 1 to N. Japate can carry only one bag of gold with him, so he uses the following strategy to choose a bag.

Initially, he starts with an empty bag (zero weight). He considers the bags in some order. If the current bag has a higher weight than the bag in his hand, he picks the current bag.

Japate put the bags in some order. Japate realizes that he will pick A bags, if he starts picking bags from the front, and will pick B bags, if he starts picking bags from the back. By picking we mean replacing the bag in his hand with the current one.

Now he wonders how many permutations of bags are possible, in which he picks A bags from the front and B bags from back using the above strategy.

Since the answer can be very large, output it modulo 998244353.

Input

The only line of input contains three space separated integers N (1 ≤ N ≤ 105), A and B (0 ≤ A, B ≤ N).

Output

Output a single integer — the number of valid permutations modulo 998244353.

Examples

Input

1 1 1


Output

1

Input

2 1 1


Output

0

Input

2 2 1


Output

1

Input

5 2 2


Output

22

Note

In sample case 1, the only possible permutation is [1]

In sample cases 2 and 3, only two permutations of size 2 are possible:{[1, 2], [2, 1]}. The values of a and b for first permutation is 2 and 1, and for the second permutation these values are 1 and 2. 

In sample case 4, out of 120 permutations of [1, 2, 3, 4, 5] possible, only 22 satisfy the given constraints of a and b.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int __SIZE = (1 << 21) + 1;
char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1,
                                           __c, qu[55];
int __f, qr, _eof;
inline void flush() { fwrite(obuf, 1, oS - obuf, stdout), oS = obuf; }
inline void gc(char &x) {
  x = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                   (iS == iT ? EOF : *iS++))
                : *iS++);
}
inline void pc(char x) {
  *oS++ = x;
  if (oS == oT) flush();
}
inline void pstr(const char *s) {
  int __len = strlen(s);
  for (__f = 0; __f < __len; ++__f) pc(s[__f]);
}
inline void gstr(char *s) {
  for (__c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                         (iS == iT ? EOF : *iS++))
                       : *iS++);
       __c < 32 || __c > 126 || __c == ' ';)
    __c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                    : *iS++);
  for (; __c > 31 && __c < 127 && __c != ' ';
       ++s, __c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++)) {
    *s = __c;
  }
  *s = 0;
}
template <class I>
inline bool gi(I &x) {
  _eof = 0;
  for (__f = 1,
      __c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                        (iS == iT ? EOF : *iS++))
                      : *iS++);
       (__c < '0' || __c > '9') && !_eof;
       __c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                         (iS == iT ? EOF : *iS++))
                       : *iS++)) {
    if (__c == '-') __f = -1;
    _eof |= __c == EOF;
  }
  for (x = 0; __c <= '9' && __c >= '0' && !_eof;
       __c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
                         (iS == iT ? EOF : *iS++))
                       : *iS++)) {
    x = x * 10 + (__c & 15), _eof |= __c == EOF;
    x *= __f;
  }
  return !_eof;
}
template <class I>
inline void print(I x) {
  if (!x) pc('0');
  if (x < 0) pc('-'), x = -x;
  while (x) {
    qu[++qr] = x % 10 + '0', x /= 10;
  }
  while (qr) pc(qu[qr--]);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher_;
}  // namespace io
using io::gc;
using io::gi;
using io::gstr;
using io::pc;
using io::print;
using io::pstr;
const int MOD = 998244353;
namespace poly {
const int MOD = 998244353;
const int NTTG = 3;
int rev[524320];
int minv[524320];
int w[20][2][524320];
int qpow(int b, int e) {
  int re = 1;
  while (e) {
    if (e & 1) re = 1ll * re * b % MOD;
    b = 1ll * b * b % MOD;
    e >>= 1;
  }
  return re;
}
void constructrev(int n) {
  for (int i = 1, j = 0; i < n; i++) {
    int bit = n >> 1;
    for (; j & bit; bit >>= 1) j ^= bit;
    j ^= bit;
    rev[i] = j;
  }
}
void constructroot(int n) {
  minv[1] = 1;
  for (int i = (2); i < (n + 1); i++)
    minv[i] = 1ll * (MOD - MOD / i) * minv[MOD % i] % MOD;
  for (int l = 1; (1 << l) <= n; l++)
    for (int inv = (0); inv < (2); inv++) {
      int re =
          inv ? qpow(minv[NTTG], (MOD - 1) >> l) : qpow(NTTG, (MOD - 1) >> l);
      w[l][inv][0] = 1;
      for (int i = (1); i < (((1 << (l - 1)) - 1) + 1); i++)
        w[l][inv][i] = 1ll * w[l][inv][i - 1] * re % MOD;
    }
}
void ntt(int *v, int n, bool inv) {
  for (int i = (0); i < (n); i++)
    if (i < rev[i]) swap(v[i], v[rev[i]]);
  for (int l = 1; (1 << l) <= n; l++)
    for (int i = 0; i < n; i += (1 << l)) {
      int p = i + (1 << (l - 1));
      for (int j = (i); j < (p); j++) {
        int a = v[j], b = 1ll * v[j + (1 << (l - 1))] * w[l][inv][j - i] % MOD;
        v[j] = (a + b >= MOD ? a + b - MOD : a + b);
        v[j + (1 << (l - 1))] = (a < b ? a + MOD - b : a - b);
      }
    }
  if (inv)
    for (int i = (0); i < (n); i++) v[i] = 1ll * v[i] * minv[n] % MOD;
}
void mult(int *a, int as, int *b, int bs, int *o, bool construct,
          bool clean = 0, int th = 100000000) {
  int n = as + bs - 1;
  while (n - (n & (-n))) n += (n & (-n));
  if (construct) constructroot(n);
  constructrev(n);
  ntt(a, n, 0);
  ntt(b, n, 0);
  for (int i = (0); i < (n); i++) o[i] = 1ll * a[i] * b[i] % MOD;
  ntt(o, n, 1);
  for (int i = (th); i < (n); i++) o[i] = 0;
  if (clean)
    for (int i = (0); i < (n); i++) a[i] = b[i] = 0;
}
void cfn(int *a, int as, int *o) {
  static int tmp[524320];
  if (as == 1) {
    tmp[0] = a[0];
    o[0] = qpow(a[0], MOD - 2);
    return;
  }
  cfn(a, (as + 1) / 2, o);
  int le = 0;
  while ((1 << le) < (as << 1)) le++;
  constructrev(1 << le);
  for (int i = (0); i < (as); i++) tmp[i] = a[i];
  for (int i = (as); i < (1 << le); i++) tmp[i] = o[i] = 0;
  ntt(tmp, 1 << le, 0);
  ntt(o, 1 << le, 0);
  for (int i = (0); i < (1 << le); i++)
    o[i] = 1ll * (MOD + (2 - 1ll * tmp[i] * o[i]) % MOD) * o[i] % MOD;
  ntt(o, 1 << le, 1);
  for (int i = (as); i < (1 << le); i++) o[i] = 0;
}
void deriv(int *a, int as, int *o) {
  for (int i = (1); i < ((as - 1) + 1); i++) {
    o[i - 1] = 1ll * i * a[i] % MOD;
  }
  o[as - 1] = 0;
}
void integ(int *a, int as, int *o) {
  for (int i = as - 2; i >= 0; i--) {
    o[i + 1] = 1ll * minv[i + 1] * a[i] % MOD;
  }
  o[0] = 0;
}
void ln(int *a, int as, int *o) {
  static int iv[524320];
  cfn(a, as, iv);
  deriv(a, as, a);
  mult(iv, as, a, as, o, 0, 1, as);
  integ(o, as, o);
}
void exp(int *a, int as, int *o) {
  static int tmp[524320], tmp2[524320], tmp3[524320];
  if (as == 1) {
    o[0] = 1;
    return;
  }
  exp(a, (as + 1) / 2, o);
  for (int i = (0); i < (as); i++) tmp[i] = o[i], tmp3[i] = 0;
  ln(tmp, as, tmp3);
  for (int i = (0); i < (as); i++)
    tmp3[i] = (MOD + a[i] - tmp3[i] + (i == 0)) % MOD, tmp2[i] = o[i];
  mult(tmp2, as, tmp3, as, o, 0, 1);
}
void pow(int *a, int as, int *o, int ex) {
  static int tmp[524320];
  ln(a, as, tmp);
  for (int i = (0); i < (as); i++) tmp[i] = 1ll * tmp[i] * ex % MOD;
  exp(tmp, as, o);
}
void init(int n) { constructroot(n); }
}  // namespace poly
int ones[524320];
int lnones[524320];
int imed[524320];
int imedk[524320];
int ans[524320];
int fac[524320];
int ifac[524320];
vector<int> make(int n, int k) {
  n++;
  int l = 1;
  while (l < (n << 1)) l <<= 1;
  int p = max(n, k);
  memset(fac, 0, sizeof fac);
  memset(ones, 0, sizeof ones);
  memset(lnones, 0, sizeof ones);
  memset(imed, 0, sizeof ones);
  memset(imedk, 0, sizeof ones);
  memset(ans, 0, sizeof ones);
  fac[0] = 1;
  for (int i = (1); i < ((p) + 1); i++)
    fac[i] = 1ll * fac[i - 1] * i % poly::MOD;
  poly::init(l);
  for (int i = (0); i < (n); i++) ones[i] = 1;
  poly::ln(ones, n, lnones);
  for (int i = (0); i < (n); i++) imed[i] = lnones[i + 1];
  poly::pow(imed, n - 1, imedk, k);
  long long re = poly::qpow(fac[k], poly::MOD - 2);
  for (int i = (k); i < (n); i++) ans[i] = 1ll * imedk[i - k] * re % poly::MOD;
  vector<int> ee(n);
  for (int i = (0); i < (n); i++) ee[i] = (1ll * ans[i] * fac[i] % poly::MOD);
  return ee;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, a, b;
  cin >> n >> a >> b;
  auto X = make(n, a - 1);
  auto Y = make(n, b - 1);
  ifac[0] = 1;
  for (int i = (1); i < ((n + 1) + 1); i++)
    ifac[i] = 1ll * ifac[i - 1] * poly::minv[i] % MOD;
  int ans = 0;
  for (int i = (1); i < ((n) + 1); i++)
    ans = (ans +
           1ll * X[i - 1] * Y[n - i] % MOD * ifac[i - 1] % MOD * ifac[n - i]) %
          MOD;
  cout << 1ll * ans * fac[n - 1] % MOD << endl;
}