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 int MAXN = 1 << 17;
namespace fft {
const int mod = 998244353;
const int gen = 3;
int rootpw[MAXN], AV[MAXN], BV[MAXN];
int modex(int a, int p) {
  if (!p) return 1;
  if (p & 1) return (long long)a * modex(a, p - 1) % mod;
  long long v = modex(a, p >> 1);
  return v * v % mod;
}
void fft(int *a, int n) {
  for (int i = 0; i < n; ++i) {
    int j = 0;
    int x = i, y = n - 1;
    while (y) {
      j = (j << 1) + (x & 1);
      x >>= 1;
      y >>= 1;
    }
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 1; len < n; len <<= 1) {
    int root = modex(gen, (mod - 1) / (2 * len));
    rootpw[0] = 1;
    for (int i = 1; i < len; ++i)
      rootpw[i] = (long long)rootpw[i - 1] * root % mod;
    for (int i = 0; i < n; i += 2 * len) {
      for (int j = 0; j < len; ++j) {
        int u = a[i + j], v = (long long)a[i + j + len] * rootpw[j] % mod;
        a[i + j] = u + v >= mod ? u + v - mod : u + v;
        a[i + j + len] = u - v < 0 ? u - v + mod : u - v;
      }
    }
  }
}
void multiply(int *A, int *B, int *C, int n) {
  for (int i = 0; i < n; ++i) {
    AV[i] = A[i];
    BV[i] = B[i];
  }
  fft(AV, n);
  fft(BV, n);
  int inv = modex(n, mod - 2);
  for (int i = 0; i < n; ++i) C[i] = (long long)AV[i] * BV[i] % mod;
  fft(C, n);
  reverse(C + 1, C + n);
  for (int i = 0; i < n; ++i) C[i] = (long long)C[i] * inv % mod;
}
};  // namespace fft
const long long MOD = fft::mod;
vector<int> solve(int s, int e) {
  if (s > e) return {1};
  if (s == e) {
    return {1, s};
  }
  int m = (s + e) / 2;
  int p = 32 - __builtin_clz(e - s + 1);
  int n = 1 << p;
  auto a = solve(s, m);
  auto b = solve(m + 1, e);
  a.resize(n);
  b.resize(n);
  vector<int> c(n);
  fft::multiply(a.data(), b.data(), c.data(), n);
  return c;
}
long long fac[200005], invfac[200005];
long long binom(int a, int b) {
  if (b > a) return 0;
  return (((fac[a] * invfac[b]) % MOD) * invfac[a - b]) % MOD;
}
long long modex(long long a, long long p, long long m = MOD) {
  if (!p) return 1;
  if (p & 1) return a * modex(a, p - 1, m) % m;
  long long v = modex(a, p >> 1, m);
  return v * v % m;
}
int main() {
  fac[0] = invfac[0] = 1;
  for (int i = 1; i < 200005; ++i) {
    fac[i] = (fac[i - 1] * i) % MOD;
    invfac[i] = modex(fac[i], MOD - 2);
  }
  int N, A, B;
  scanf("%d%d%d", &N, &A, &B);
  if (N == 1) {
    printf(A == 1 && B == 1 ? "1\n" : "0\n");
    return 0;
  }
  if (!A || !B || A + B < 3 || A + B - 1 > N) {
    printf("0\n");
    return 0;
  }
  auto res = solve(1, N - 2);
  long long ans = binom(A + B - 2, A - 1) * res[N - 2 - (A + B - 3)] % MOD;
  printf("%lld\n", ans);
}