#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5, mod = 998244353;
long long T, p, s, r, Ans, fac[maxn], inv[maxn];
int read() {
  int x = 0, f = 1;
  char c;
  do {
    c = getchar();
    if (c == '-') f *= -1;
  } while (!isdigit(c));
  while (isdigit(c)) {
    x = (x << 3) + (x << 1) + c - '0';
    c = getchar();
  }
  return x * f;
}
int qpow(int x, int i) {
  int res = 1;
  while (i) {
    if (i & 1) {
      res = 1ll * res * x % mod;
    }
    x = 1ll * x * x % mod;
    i /= 2;
  }
  return res;
}
int C(int x, int y) {
  if (y > x) return 0;
  return 1ll * fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int main() {
  fac[0] = 1;
  for (int i = 1; i <= 500000; i++) {
    fac[i] = 1ll * fac[i - 1] * i % mod;
  }
  inv[500000] = qpow(fac[500000], mod - 2);
  for (int i = 500000; i; i--) {
    inv[i - 1] = 1ll * inv[i] * i % mod;
  }
  Ans = 0;
  p = read();
  s = read();
  r = read();
  long long opt = 1;
  for (int i = 1; i <= p; i++) {
    Ans = (Ans + opt * C(p, i) * C(s - i * r + p - 1, p - 1) % mod) % mod;
    opt *= -1;
  }
  Ans = (1ll * Ans * qpow(1ll * C(s - r + p - 1, p - 1) * p % mod, mod - 2)) %
        mod;
  printf("%d\n", Ans);
  return 0;
}
