#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long C[5005][5005];
long long p, s, r;
inline long long qpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % MOD;
    b >>= 1;
    a = a * a % MOD;
  }
  return ret;
}
long long calc(long long n, long long m, long long x) {
  long long ret = 0;
  for (int k = 0; k <= m && x * k <= n; k++) {
    long long tmp = C[k][m] * C[m - 1][n + m - 1 - k * x] % MOD;
    ret += (k & 1) ? -tmp : tmp;
  }
  return ((ret % MOD) + MOD) % MOD;
}
int main() {
  C[0][0] = 1;
  for (int i = 1; i <= 5000; i++) {
    C[i][i] = C[0][i] = 1;
    for (int j = 1; j <= i; j++)
      C[j][i] = (C[j - 1][i - 1] + C[j][i - 1]) % MOD;
  }
  long long ans = 0;
  scanf("%lld %lld %lld", &p, &s, &r);
  for (int x = r; x <= s; x++) {
    if (x * p < s) continue;
    for (int i = 1; i <= p; i++) {
      if (i * x > s || (p - i) * (x - 1) + i * x < s) continue;
      if (i == p)
        (ans += (i * x == s ? qpow(i, MOD - 2) : 0)) %= MOD;
      else
        (ans += (C[i - 1][p - 1] * calc(s - i * x, p - i, x) % MOD *
                 qpow(i, MOD - 2) % MOD)) %= MOD;
    }
  }
  printf("%lld", ans * qpow(C[p - 1][s - r + p - 1], MOD - 2) % MOD);
  return 0;
}
