#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, G = 3, gi = 332748118;
const int N = 8e5 + 5;
int R[N], n, A[N], B[N], f[N], g[N], fac[N], invfac[N], a, b;
int fpow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod, y >>= 1;
  }
  return res;
}
void DFT(int *a, int f, int n) {
  for (int i = 0; i < n; i++)
    if (i < R[i]) swap(a[i], a[R[i]]);
  for (int i = 1; i < n; i <<= 1) {
    int wn = fpow((f == 1 ? G : gi), (mod - 1) / (i << 1));
    for (int j = 0; j < n; j += (i << 1)) {
      int w = 1;
      for (int k = 0; k < i; k++, w = 1ll * w * wn % mod) {
        int x = a[j + k], y = 1ll * w * a[j + k + i] % mod;
        a[j + k] = (x + y) % mod;
        a[j + k + i] = (x - y + mod) % mod;
      }
    }
  }
  if (f == -1) {
    int inv = fpow(n, mod - 2);
    for (int i = 0; i < n; i++) a[i] = 1ll * a[i] * inv % mod;
  }
}
void NTT(int *a, int *b, int n, int m) {
  int L = 0, pn = n, pm = m;
  m += n;
  for (n = 1; n <= m; n <<= 1) L++;
  for (int i = 0; i < n; i++) R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
  for (int i = pn + 1; i < n; i++) a[i] = 0;
  for (int i = pm + 1; i < n; i++) b[i] = 0;
  DFT(a, 1, n);
  DFT(b, 1, n);
  for (int i = 0; i < n; i++) a[i] = 1ll * a[i] * b[i] % mod;
  DFT(a, -1, n);
}
void work(int n) {
  for (int i = 0; i <= n; i++)
    A[i] = 1ll * fpow(n, n - i) * invfac[n - i] % mod;
  for (int i = 0; i <= n; i++) B[i] = 1ll * g[i] * fac[i] % mod;
  NTT(A, B, n, n);
  for (int i = 0; i <= n; i++) f[i] = 1ll * A[n + i] * invfac[i] % mod;
}
void solve(int n) {
  if (n == 1) {
    g[1] = 1;
    g[0] = 0;
  } else if (n & 1) {
    solve(n - 1);
    for (int i = 0; i <= n - 1; i++) f[i] = g[i], g[i] = 0;
    for (int i = 1; i <= n; i++) g[i] = f[i - 1];
    for (int i = 0; i < n; i++)
      g[i] = (g[i] + 1ll * f[i] * (n - 1) % mod) % mod;
  } else {
    int m = n / 2;
    solve(m);
    work(m);
    NTT(g, f, m, m);
  }
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  if (a == 0 || b == 0 || a + b > n + 1) {
    puts("0");
    return 0;
  }
  if (n == 1) {
    puts("1");
    return 0;
  }
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  invfac[n] = fpow(fac[n], mod - 2);
  for (int i = n - 1; i >= 0; i--)
    invfac[i] = 1ll * invfac[i + 1] * (i + 1) % mod;
  solve(n - 1);
  printf("%d\n", 1ll * g[a + b - 2] * fac[a + b - 2] % mod * invfac[a - 1] %
                     mod * invfac[b - 1] % mod);
  return 0;
}
