#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int fac[301010], rev[301010], A[301010], B[301010], C[301010], deg[301010],
    pos[301010];
int N, E, F, P = 998244353, I;
void fft(int *a, int PM, int PW) {
  for (int m = N, h; h = m >> 1, m > 1; PW = (long long)PW * PW % PM, m = h) {
    for (int i = 0, w = 1; i < h; i++, w = (long long)w * PW % PM)
      for (int j = i; j < N; j += m) {
        register int k = j + h, first = (a[j] - a[k] + PM) % PM;
        (a[j] += a[k]) %= PM;
        a[k] = (long long)first * w % PM;
      }
  }
  for (int i = 0, j = 1; j < N - 1; j++) {
    for (int k = N >> 1; k > (i ^= k); k >>= 1)
      ;
    if (j < i) swap(a[i], a[j]);
  }
}
int mul(int *a, int na, int *b, int nb, int now) {
  for (N = 1; N < na + nb - 1; N <<= 1)
    ;
  for (int i = 0; i < na; i++) B[i] = a[i];
  for (int i = na; i < N; i++) B[i] = 0;
  for (int i = 0; i < nb; i++) C[i] = b[i];
  for (int i = nb; i < N; i++) C[i] = 0;
  I = power(N, P - 2, P);
  E = power(3, (P - 1) / N, P);
  F = power(E, P - 2, P);
  fft(B, P, E);
  fft(C, P, E);
  for (int i = 0; i < N; i++) B[i] = (long long)B[i] * C[i] % P;
  fft(B, P, F);
  for (int i = 0; i < na + nb - 1; i++) A[i + now] = (long long)B[i] * I % P;
  return na + nb - 1;
}
int main() {
  int n, a, b;
  gn(n, a, b);
  if (!a || !b || a + b - 1 > n) return puts("0"), 0;
  if (n == 1) return puts(a + b == 2 ? "1" : "0"), 0;
  if (a + b == 2) return puts("0"), 0;
  if (n == 2) return puts(a + b == 3 ? "1" : "0");
  for (int i = fac[0] = 1; i <= n; i++)
    fac[i] = (long long)fac[i - 1] * i % 998244353;
  rev[n] = power(fac[n], 998244353 - 2, 998244353);
  for (int i = n - 1; i >= 0; i--)
    rev[i] = (long long)rev[i + 1] * (i + 1) % 998244353;
  int ans = (long long)fac[a + b - 2] * rev[a - 1] % 998244353 * rev[b - 1] %
            998244353;
  int nn = 0;
  for (int i = 1; i < n - 1; i++) {
    deg[nn] = 2;
    pos[nn++] = i * 2 - 2;
    A[i * 2 - 2] = i, A[i * 2 - 1] = 1;
  }
  while (nn > 1) {
    int now = 0, tn = 0;
    for (int i = 0; i + 1 < nn; i += 2) {
      pos[tn] = now,
      deg[tn] = mul(A + pos[i], deg[i], A + pos[i + 1], deg[i + 1], now);
      now += deg[tn];
      tn++;
    }
    if (nn & 1) {
      pos[tn] = now;
      deg[tn] = deg[nn - 1];
      for (int i = 0; i < deg[tn]; i++) A[now + i] = A[pos[nn - 1] + i];
      tn++;
    }
    nn = tn;
  }
  println((long long)ans * A[a + b - 3] % 998244353);
  return 0;
}
