#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long INF = mod * mod;
const long double eps = 1e-5;
const long double pi = acos(-1.0);
long long mod_pow(long long x, long long n) {
  long long ret = 1;
  while (n > 0) {
    if (n % 2) ret = ret * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return ret;
}
struct perm {
 private:
  int sz;
  vector<long long> p, invp;

 public:
  perm(int n) {
    sz = n + 1;
    p.resize(sz), invp.resize(sz);
    p[0] = 1;
    for (int i = 1; i <= sz - 1; i++) {
      p[i] = p[i - 1] * i % mod;
    }
    invp[sz - 1] = 1;
    long long cop = mod - 2, x = p[sz - 1];
    while (cop) {
      if (cop % 2) invp[sz - 1] = invp[sz - 1] * x % mod;
      cop >>= 1;
      x = x * x % mod;
    }
    for (int i = sz - 1 - 1; i >= 0; i--) {
      invp[i] = invp[i + 1] * (i + 1) % mod;
    }
  }
  long long comb(long long x, long long y) {
    if (x < y || y < 0) return 0;
    long long ret = p[x];
    (ret *= invp[y]) %= mod;
    (ret *= invp[x - y]) %= mod;
    return ret;
  }
  long long combP(long long x, long long y) {
    if (x < y || y < 0) return 0;
    return p[x] * invp[x - y] % mod;
  }
};
perm pm(1 << 17);
void solve() {
  int p, s, r;
  cin >> p >> s >> r;
  long long ans = 0;
  for (int x = 1; x < p; x++) {
    for (int y = r; y <= s; y++) {
      int rest = s - x * y;
      if (rest < 0) break;
      long long csum = 0;
      for (int z = 0; z <= p - x; z++) {
        int sum = rest - z * y;
        if (sum < 0) break;
        long long pro = pm.comb(p - x, z);
        pro = pro * pm.comb(sum + p - x - 1, sum) % mod;
        if (z % 2) {
          csum -= pro;
        } else {
          csum += pro;
        }
      }
      csum = (csum % mod + mod) % mod;
      csum = csum * pm.comb(p - 1, x - 1) % mod * mod_pow(x, mod - 2) % mod;
      ans += csum;
    }
  }
  for (int y = r; y <= s; y++) {
    int rest = s - p * y;
    if (rest == 0) {
      ans += mod_pow(p, mod - 2);
    }
  }
  ans %= mod;
  long long inv = 0;
  for (int y = r; y <= s; y++) {
    inv += pm.comb(s - y + p - 2, s - y);
  }
  inv %= mod;
  ans = ans * mod_pow(inv, mod - 2) % mod;
  cout << ans << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
