#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long cd, s, r, fact[10001], sf[10001], invmod[10001];
void inp() { cin >> cd >> s >> r; }
long long bigmod(long long base, long long hat) {
  if (hat == 0) return 1;
  long long k = bigmod(base, hat / 2);
  if (hat % 2 == 0) return k * k % mod;
  return k * k % mod * base % mod;
}
void create() {
  for (long long i = 0; i <= 10000; i++) {
    if (i == 0)
      fact[i] = 1;
    else
      fact[i] = fact[i - 1] * i % mod;
    sf[i] = bigmod(fact[i], mod - 2);
    invmod[i] = bigmod(i, mod - 2);
  }
}
long long C(long long k, long long n) {
  if (k > n || k < 0 || n < 0) return 0;
  return fact[n] * sf[k] % mod * sf[n - k] % mod;
}
void do_it() {
  create();
  long long all = 0, kq = 0;
  for (long long i = r; i <= s; i++) {
    all += C(cd - 2, s - i + cd - 1 - 1);
    all %= mod;
    if (cd * i == s) kq += invmod[cd], kq %= mod;
    for (long long e = 1; e < cd; e++) {
      if (e * i > s) break;
      long long remain = s - e * i, inv = 0;
      remain += cd - e;
      long long space = C(e - 1, cd - 1) * C(cd - e - 1, remain - 1) % mod;
      for (long long f = 1; f <= cd - e; f++) {
        long long t = remain - i * f;
        if (t < 0 || cd - e - 1 > t - 1) break;
        if (f % 2 == 1)
          inv += C(cd - e - 1, t - 1) * C(f, cd - e) % mod;
        else
          inv -= C(cd - e - 1, t - 1) * C(f, cd - e) % mod;
        inv += mod * 5, inv %= mod;
      }
      inv *= C(cd - e, cd - 1);
      space -= inv, space += mod * 5, space %= mod;
      kq += space * invmod[e] % mod, kq %= mod;
    }
  }
  if (cd == 1) kq = 1, all = 1;
  cout << kq * bigmod(all, mod - 2) % mod << endl;
}
int main() {
  inp();
  do_it();
}
