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;
const long long mod = 998244353, maxn = 4e5;
long long jc[444444], injc[444444], n, a, b, s[444444], t[444444], l, r,
    pw[444444], sz, rev[444444], cnt;
long long S[444444], T[444444];
long long binpow(long long a, long long t) {
  long long res = 1, p = a;
  for (long long i = t; i; i >>= 1) {
    if (i & 1) res = res * p % mod;
    p = p * p % mod;
  }
  return res;
}
long long C(long long n, long long k) {
  if (n < k) return 0;
  return (jc[n] * injc[k] % mod) * injc[n - k] % mod;
}
void Init() {
  jc[0] = injc[0] = 1;
  for (long long i = 1; i <= maxn; i++) {
    jc[i] = jc[i - 1] * i % mod;
  }
  injc[maxn] = binpow(jc[maxn], mod - 2);
  for (int i = maxn - 1; i >= 0; i--) injc[i] = injc[i + 1] * (i + 1) % mod;
}
void ntt(long long c[], long long flag) {
  for (long long i = 0; i < sz; i++) {
    if (rev[i] > i) swap(c[i], c[rev[i]]);
  }
  for (long long i = 2; i <= sz; i <<= 1) {
    for (long long j = 0; j < sz; j += i) {
      long long w, wn;
      w = 1;
      if (flag == 1)
        wn = binpow(3ll, (mod - 1) / i);
      else
        wn = binpow(3ll, (mod - 1) - (mod - 1) / i);
      for (long long k = j; k < j + i / 2; k++) {
        long long tmp1 = c[k];
        long long tmp2 = c[k + i / 2] * w % mod;
        c[k] = (tmp1 + tmp2) % mod;
        c[k + i / 2] = (tmp1 - tmp2) % mod;
        w = w * wn % mod;
      }
    }
  }
  if (flag == -1) {
    for (long long i = 0; i < sz; i++) {
      c[i] = c[i] * binpow(sz, mod - 2) % mod;
    }
  }
}
void doit() {
  rev[0] = 0;
  for (long long i = 1; i < sz; i++) {
    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (cnt - 1));
  }
  ntt(S, 1);
  ntt(T, 1);
  for (long long i = 0; i < sz; i++) S[i] = S[i] * T[i] % mod;
  ntt(S, -1);
}
void solve(long long n) {
  if (n == 1) {
    s[1] = 1;
    return;
  }
  if (!n) {
    s[0] = 1;
    return;
  }
  if (n & 1) {
    solve(n - 1);
    t[0] = s[0] * (n - 1) % mod;
    for (long long i = 1; i <= n; i++) t[i] = (s[i - 1] + s[i] * (n - 1)) % mod;
    for (long long i = 1; i <= n; i++) s[i] = t[i];
  } else {
    solve(n >> 1);
    pw[0] = 1;
    sz = 1;
    cnt = 0;
    while (sz <= n) {
      sz *= 2;
      cnt++;
    }
    for (long long i = 1; i <= (n >> 1); i++)
      pw[i] = pw[i - 1] * (n >> 1) % mod;
    for (long long i = 0; i < sz; i++) S[i] = T[i] = 0;
    for (long long i = 0; i <= (n >> 1); i++) S[i] = s[i] * jc[i] % mod;
    for (long long i = 0; i <= (n >> 1); i++) T[i] = pw[i] * injc[i] % mod;
    reverse(T, T + (n >> 1) + 1);
    doit();
    for (long long j = 0; j < sz; j++) T[j] = 0;
    for (long long j = (n >> 1); j <= n; j++)
      T[j - (n >> 1)] = S[j] * injc[j - (n >> 1)] % mod;
    for (long long j = 0; j < sz; j++) S[j] = s[j];
    doit();
    for (long long j = 0; j <= n; j++) s[j] = S[j];
  }
}
int main() {
  cin >> n >> a >> b;
  Init();
  n--;
  if (!n) {
    if (!(a + b - 2))
      cout << C(a + b - 2, a - 1) << endl;
    else
      cout << 0 << endl;
    return 0;
  }
  solve(n);
  cout << (s[a + b - 2] * C(a + b - 2, a - 1) % mod + mod) % mod << endl;
  return 0;
}