#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long ksm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD, b >>= 1;
  }
  return res;
}
const int N = 6005;
long long fac[N], inv[N];
void init(int n = 6000) {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % MOD;
  inv[n] = ksm(fac[n], MOD - 2);
  for (int i = n; i >= 1; i--) inv[i - 1] = inv[i] * i % MOD;
  return;
}
long long C(int n, int m) {
  if (m > n) return 0;
  if (m == 0 || m == n) return 1;
  return fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}
long long calc(int n, int m, int x) {
  if (m == 0) {
    if (n == 0)
      return 1;
    else
      return 0;
  }
  long long res = 0;
  for (int i = 0; i <= m; i++) {
    long long sum = C(m, i) * C(n - x * i + m - 1, m - 1) % MOD;
    if (i & 1)
      res = (res - sum + MOD) % MOD;
    else
      res = (res + sum) % MOD;
  }
  return res;
}
int p, s, r;
int main() {
  init();
  scanf("%d%d%d", &p, &s, &r);
  if (p == 1) {
    printf("1");
    return 0;
  }
  long long ans = 0;
  for (int x = r; x <= s; x++) {
    if (x * p < s) continue;
    for (int i = 1; i <= p; i++) {
      if (i * x > s) break;
      if ((p - i) * (x - 1) + i * x < s) continue;
      ans = (ans + C(p - 1, i - 1) * calc(s - x * i, p - i, x) % MOD *
                       ksm(i, MOD - 2) % MOD) %
            MOD;
    }
  }
  ans = ans * ksm(C(s - r + p - 1, p - 1), MOD - 2) % MOD;
  printf("%lld", ans);
  return 0;
}
