#include <bits/stdc++.h>
using namespace std;
long long p, s, r, fac[5010], ifac[5010];
inline long long pw(long long x, long long n) {
  long long y = 1;
  n = (n + 998244353 - 1) % (998244353 - 1);
  for (; n; n >>= 1, x = x * x % 998244353) y = (n & 1) ? y * x % 998244353 : y;
  return y;
}
inline long long C(long long n, long long m) {
  return fac[n] * ifac[m] % 998244353 * ifac[n - m] % 998244353;
}
int main() {
  fac[0] = ifac[0] = 1;
  for (int i = (1); i <= (5010); ++i) fac[i] = fac[i - 1] * i % 998244353;
  ifac[5010] = pw(fac[5010], -1);
  for (int i = 5010 - 1; i; --i) ifac[i] = ifac[i + 1] * (i + 1) % 998244353;
  cin >> p >> s >> r;
  long long tot = C(s - r + p - 1, p - 1), win = 0;
  for (int a1 = (max(r, (s + p - 1) / p)); a1 <= (s); ++a1) {
    if (a1 == 0) {
      win = pw(p, -1);
      break;
    }
    for (int tie = (1); tie <= (p); ++tie) {
      if (tie * a1 > s) break;
      long long totsc = s - tie * a1, pop = p - tie, cnt = 0;
      for (int j = (0); j <= (pop); ++j) {
        long long tmpsc = totsc - a1 * j;
        if (tmpsc < 0) break;
        cnt = (cnt +
               C(pop, j) *
                   (pop == 0 && tmpsc == 0 ? 1 : C(tmpsc + pop - 1, pop - 1)) *
                   (j & 1 ? -1 : 1)) %
              998244353;
      }
      win += (cnt + 998244353) * C(p - 1, tie - 1) % 998244353 * pw(tie, -1) %
             998244353;
    }
  }
  cout << win * pw(tot, -1) % 998244353 << endl;
  return 0;
}
