#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long e, long long m) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b % m, e / 2, m) % m;
  return power(b * b % m, e / 2, m);
}
long long power(long long b, long long e) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b, e / 2);
  return power(b * b, e / 2);
}
long long inv[10000 + 5], fac_inv[10000 + 5], fac[10000 + 5];
void initialize() {
  long long i;
  inv[1] = 1;
  for (i = 2; i <= 10000; i++)
    inv[i] = (998244353 - 998244353 / i) * inv[998244353 % i] % 998244353;
  fac[0] = fac[1] = 1;
  for (i = 2; i <= 10000; i++) fac[i] = i * fac[i - 1] % 998244353;
  fac_inv[0] = fac_inv[1] = 1;
  for (i = 2; i <= 10000; i++) fac_inv[i] = inv[i] * fac_inv[i - 1] % 998244353;
}
long long ncr(long long n, long long r) {
  if (n < 0 || r < 0) return 0;
  if (n < r) return 0;
  return (fac[n] * fac_inv[r] % 998244353) * fac_inv[n - r] % 998244353;
}
long long solve(long long sc, long long n, long long s) {
  if (s < 0) return 0;
  if (n == 0 && s == 0) return 1LL;
  long long ret = ncr(s + n - 1, n - 1);
  for (long long i = 1; i <= n; ++i) {
    long long kk = ncr(s - i * sc + n - 1, n - 1);
    kk *= ncr(n, i);
    kk %= 998244353;
    if (i & 1)
      ret -= kk;
    else
      ret += kk;
    ret += 998244353;
    ret %= 998244353;
  }
  return ret;
}
int _runtimeTerror_() {
  long long p, s, r, i;
  cin >> p >> s >> r;
  long long ans = 0;
  for (i = r; i <= s; ++i) {
    for (long long j = 1; j <= p; ++j) {
      long long fuck = solve(i, p - j, s - i * j);
      ans += fuck * power(j, 998244353 - 2, 998244353) % 998244353 *
             ncr(p - 1, j - 1) % 998244353;
      ans %= 998244353;
    }
  }
  long long tt = ncr(s - r + p - 1, p - 1);
  cout << ans * power(tt, 998244353 - 2, 998244353) % 998244353 << "\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  initialize();
  int TESTS = 1;
  while (TESTS--) _runtimeTerror_();
  return 0;
}
