#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long power(long long a, long long r) {
  long long res = 1;
  for (; r; r >>= 1, a = a * a % mod)
    if (r & 1) res = res * a % mod;
  return res;
}
long long f[6000], uf[6000];
long long C(int m, int n) {
  if (m < n) return 0;
  return f[m] * uf[n] % mod * uf[m - n] % mod;
}
long long g(int m, int n, int p) {
  long long r = 0;
  if (n == 0) return m == 0;
  for (int u = 1, i = 0;; u = mod - u, i += 1) {
    long long k = C(m - i * p + n - 1, n - 1) * C(n, i) % mod * u % mod;
    if (k == 0) break;
    r = (r + k) % mod;
  }
  return r;
}
int main() {
  for (int i = 0; i < 6000; i += 1)
    uf[i] = power(f[i] = i ? f[i - 1] * i % mod : 1, mod - 2);
  int p, r, s;
  cin >> p >> s >> r;
  long long ans = 0;
  for (int a = r; a <= s; a += 1)
    for (int x = 1; a * x <= s && x <= p; x += 1) {
      ans += C(p - 1, x - 1) * g(s - x * a, p - x, a) % mod *
             power(x, mod - 2) % mod;
      ans %= mod;
    }
  ans = ans * power(C(s - r + p - 1, p - 1), mod - 2) % mod;
  cout << ans;
}
