#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353, inv[10010], fac[10010], infac[10010];
long long C(long long n, long long m) {
  if (n < m || n < 0 || m < 0) return 0;
  return fac[n] * infac[m] % mod * infac[n - m] % mod;
}
long long f(long long n, long long s, long long a) {
  if (!s) return 1;
  if (s < 0 || n * (a - 1) < s) return 0;
  long long sum = 0;
  for (long long i = 0; i <= n; i++)
    sum =
        (sum + (i & 1 ? -1 : 1) * C(n, i) % mod * C(s - i * a + n - 1, n - 1)) %
        mod;
  return (sum + mod) % mod;
}
long long kuai(long long a, long long b) {
  long long c = 1;
  for (; b; b >>= 1) {
    if (b & 1) c = a * c % mod;
    a = a * a % mod;
  }
  return c;
}
int main() {
  long long p, s, r;
  scanf("%lld%lld%lld", &p, &s, &r);
  inv[1] = fac[0] = fac[1] = infac[0] = infac[1] = 1;
  for (long long i = 2; i <= 10000; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = mod - (mod / i) * inv[mod % i] % mod;
    infac[i] = infac[i - 1] * inv[i] % mod;
  }
  long long ans = 0;
  for (long long i = 1; i <= p; i++)
    for (long long j = r; j <= s; j++)
      if (i * j + (p - i) * (j - 1) >= s)
        ans = (ans + C(p - 1, i - 1) * inv[i] % mod * f(p - i, s - i * j, j)) %
              mod;
  printf("%lld", ans * kuai(C(s - r + p - 1, p - 1), mod - 2) % mod);
  return 0;
}
