#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e7 + 10;
const int P = 998244353;
void add(int &a, int b) {a += b; a >= P ? a -= P : 0;}
void sub(int &a, int b) {a -= b; a < 0 ? a += P : 0;}
int ksm(int x, int k) {
  int res = 1;
  for(int pw = x; k; (k & 1) ? res = 1ll * res * pw % P : 0, pw = 1ll * pw * pw % P, k >>= 1);
  return res;
}
int fac[N], ifac[N], pw[N], ipw[N];
void init() {
  fac[0] = ifac[0] = 1;
  for(int i = 1; i < N; i++)fac[i] = 1ll * fac[i - 1] * i % P;
  ifac[N - 1] = ksm(fac[N - 1], P - 2);
  for(int i = N - 2; i; i--)ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P;
  for(int i = 1; i < N; i <<= 1)pw[i] = ksm(3, (P - 1) / i);
  for(int i = 1; i < N; i <<= 1)ipw[i] = ksm(pw[i], P - 2);
  return ;
}
int com(int n, int m) {return n < m || m < 0 ? 0 : 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;}
int n, m, x;
int pre[N], suf[N], f[N], g[N], h[N], rev[N];
void NTT(int *f, int len, int op) {
  for(int i = 0; i < len; i++)rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * (len >> 1));
  for(int i = 0; i < len; i++)if(i < rev[i])swap(f[i], f[rev[i]]);
  for(int k = 1; k < len; k <<= 1) {
    for(int i = 0; i < len; i += k + k) {
      int gn = (op == 1 ? pw[k + k] : ipw[k + k]), g = 1;
      for(int j = 0; j < k; j++, g = 1ll * g * gn % P) {
        int x = f[i + j], y = 1ll * g * f[i + j + k] % P;
        f[i + j] = (x + y) % P;
        f[i + j + k] = (x - y + P) % P;
      }
    }
  }
  if(op == -1) {
    int inv = ksm(len, P - 2);
    for(int i = 0; i < len; i++)f[i] = 1ll * f[i] * inv % P;
  }
  return ;
}
int main() {
  init();
  n = read(); m = read(); x = read();
  int ans = 0;
  suf[n + 1] = suf[n + 2] = 1;
  for(int i = n; i; i--)suf[i] = 1ll * suf[i + 1] * (n - (i - 1)) % P;
  for(int i = 1; i < x; i++)f[i] = 1ll * (i - 1) * fac[n - i - 1] % P;
  for(int i = 0; i <= n; i++)g[i] = ifac[i];
  int ln = 1;
  while(ln < (n + n + 5))ln <<= 1;
  NTT(f, ln, 1); NTT(g, ln, 1);
  for(int i = 0; i < ln; i++)f[i] = 1ll * f[i] * g[i] % P;
  NTT(f, ln, -1);
  // for(int i = 0; i < ln; i++)cout << f[i] << ' '; cout << endl;
  for(int r = 1; r < n; r++) {
    int res = com(r - 1 + m, m + 1);
    res = 1ll * res * suf[r + 2] % P;
    res = 1ll * res * f[n - r + 1] % P;
    add(ans, res);
  }
  if(x > 1) {
    int res = com(n - 1 + m, m + 1);
    res = 1ll * res * fac[n - 2] % P;
    add(ans, res);
  }
  for(int i = 0; i < ln; i++)f[i] = g[i] = 0;
  for(int i = 1; i < x; i++)f[i] = fac[n - i + 1];
  for(int i = 1; i <= n; i++)g[i] = ifac[i];
  // for(int v = 1; v < x; v++) {
  //   pre[1] = 1;
  //   for(int i = 2; i <= n; i++)pre[i] = 1ll * pre[i - 1] * (n - v - (i - 1)) % P;
  //   for(int r = 1; r <= n; r++) {
  //     int res = com(r - 1 + m, m + 1);
  //     res = 1ll * res * pre[r - 1] % P;
  //     res = 1ll * res * suf[r + 2] % P;
  //     if(r < n)res = 1ll * res * (v - 1) % P;
  //     add(ans, res);
  //   }
  // }
  pre[1] = 1;
  for(int i = 2; i <= n; i++)pre[i] = 1ll * pre[i - 1] * (n - x + 1 - (i - 1)) % P;
  for(int r = 1; r <= n; r++) {
    int res = com(r - 1 + m, m);
    res = 1ll * res * pre[r] % P;
    if(r < n)res = 1ll * res * (x - 1) % P;
    res = 1ll * res * suf[r + 2] % P;
    add(ans, res);
  }
  printf("%d\n", ans); 
  return 0;
}