#include <bits/stdc++.h>
const int N = 6010, mod = 998244353;
int n, s, r, res, fac[N], Invfac[N], inv[N];
int C(int n, int m) {
  if (m > n) return 0;
  return 1LL * fac[n] * Invfac[m] % mod * Invfac[n - m] % mod;
}
int ksm(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = 1LL * ans * a % mod;
    a = 1LL * a * a % mod;
    b >>= 1;
  }
  return ans;
}
int Solve(int p, int s, int m) {
  if (p == 0) return (s == 0);
  int ans = 0, t = -1;
  for (int i = 0; i <= p; i++) {
    t = -t;
    if (s - i * (m + 1) >= 0)
      ans = (ans +
             1LL * t * C(p, i) % mod * C(s - i * (m + 1) + p - 1, p - 1) % mod +
             mod) %
            mod;
  }
  return ans;
}
int main() {
  scanf("%d%d%d", &n, &s, &r);
  fac[0] = Invfac[0] = inv[1] = 1;
  for (int i = 1; i <= s + n; i++) {
    fac[i] = 1LL * fac[i - 1] * i % mod;
    if (i > 1) inv[i] = (mod - 1LL * mod / i * inv[mod % i] % mod) % mod;
  }
  Invfac[s + n] = ksm(fac[s + n], mod - 2);
  for (int i = s + n - 1; i >= 1; i--)
    Invfac[i] = 1LL * Invfac[i + 1] * (i + 1) % mod;
  for (int t = r; t <= s; t++) {
    for (int i = 1; i <= n; i++) {
      if (s - i * t >= 0) {
        res = (res + 1LL * C(n - 1, i - 1) * inv[i] % mod *
                         Solve(n - i, s - i * t, t - 1)) %
              mod;
      }
    }
  }
  res = 1LL * res * ksm(C(s - r + n - 1, n - 1), mod - 2) % mod;
  printf("%d", res);
  return 0;
}
