#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long p, s, r;
long long fac[10005];
long long qpow(long long x, long long y) {
  long long sum = 1;
  while (y) {
    if (y & 1) {
      sum = sum * x % mod;
    }
    x = x * x % mod;
    y >>= 1;
  }
  return sum;
}
long long ny(int x) { return qpow(x, mod - 2); }
long long C(long long n, long long m) {
  if (n < m || n < 0 || m < 0) return 0;
  return fac[n] * ny(fac[m]) % mod * ny(fac[n - m]) % mod;
}
long long f(long long n, long long m, long long lim) {
  if (n == 0) return 1;
  if (n < 0) return 0;
  long long sum = 0;
  for (long long i = 0; i <= m; i++) {
    long long t = (i & 1) ? (mod - 1ll) : 1ll;
    sum = (sum + t * C(m, i) % mod * C(n - i * lim + m - 1ll, m - 1ll) % mod) %
          mod;
  }
  return sum;
}
int main() {
  scanf("%d%d%d", &p, &s, &r);
  fac[0] = 1;
  for (long long i = 1; i <= 10000; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  long long ans = 0;
  for (long long i = r; i <= s; i++) {
    for (long long j = 1; j <= p; j++) {
      if ((p - j) * (i - 1) + j * i < s) continue;
      ans =
          (ans + f(s - i * j, p - j, i) * C(p - 1, j - 1) % mod * ny(j) % mod) %
          mod;
    }
  }
  printf("%lld", ans * ny(C(s - r + p - 1, p - 1)) % mod);
  return 0;
}
