#include <bits/stdc++.h>
using namespace std;
const long long M = 10006;
long long f[M], inv[M];
long long expo(long long base, long long exponent, long long mod) {
  long long ans = 1;
  while (exponent != 0) {
    if (exponent & 1) ans = (1LL * ans * base) % mod;
    base = (1LL * base * base) % mod;
    exponent >>= 1;
  }
  return ans % mod;
}
void compute() {
  f[0] = 1;
  for (long long i = 1; i < M; i++) {
    f[i] = (1LL * i * f[i - 1]) % 998244353;
  }
  inv[M - 1] = expo(f[M - 1], 998244353 - 2, 998244353);
  for (long long i = M - 2; i >= 0; i--) {
    inv[i] = (1LL * (i + 1) * inv[i + 1]) % 998244353;
  }
}
long long C(long long n, long long r) {
  return (1LL * ((1LL * f[n] * inv[r]) % 998244353) * inv[n - r]) % 998244353;
}
long long ff(long long n, long long s, long long u) {
  if (n == 0) return s == 0;
  if (s < 0 or u < 0) return 0;
  long long ans = 0;
  for (long long r = 0; r < n + 1; r++) {
    long long k = s - (u + 1) * r;
    if (k < 0) break;
    if (r % 2) {
      ans =
          (ans - C(n, r) * C(n + k - 1, k) % 998244353 + 998244353) % 998244353;
    } else {
      ans =
          (ans + C(n, r) * C(n + k - 1, k) % 998244353 + 998244353) % 998244353;
    }
  }
  return ans;
}
long long inverse[1001];
void solve() {
  compute();
  for (long long i = 1; i < 1001; i++)
    inverse[i] = expo(i, 998244353 - 2, 998244353);
  long long p, s, r, ans = 0, den = 0;
  cin >> p >> s >> r;
  for (long long i = r; i < s + 1; i++) {
    for (long long j = 1; j < p + 1; j++) {
      ans = (ans + C(p - 1, j - 1) * ff(p - j, s - j * i, i - 1) % 998244353 *
                       inverse[j] % 998244353) %
            998244353;
    }
    den = (den + ff(p - 1, s - i, s)) % 998244353;
  }
  ans = ans * expo(den, 998244353 - 2, 998244353) % 998244353;
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
