#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long pw(long long x, long long y) {
  if (y == 0) return 1;
  if (y % 2) return x * pw(x, y - 1) % mod;
  long long res = pw(x, y / 2);
  return res * res % mod;
}
long long f[10001];
long long inf[10001];
long long inv[10001];
long long C(int x, int y) { return f[x] * inf[y] % mod * inf[x - y] % mod; }
int p, r, s;
long long dp[101];
int main() {
  ios::sync_with_stdio(false);
  f[0] = inf[0] = 1;
  for (int i = 1; i <= 10000; i++) {
    f[i] = f[i - 1] * i % mod;
    inf[i] = pw(f[i], mod - 2);
    inv[i] = pw(i, mod - 2);
  }
  cin >> p >> s >> r;
  long long ans = 0;
  p--;
  long long ways = 0;
  for (int i = r; i <= s; i++) {
    if (i == 0) {
      if (s == 0) ans = (ans + inv[p + 1]) % mod;
      ways = (ways + C(s - i + p - 1, p - 1)) % mod;
      continue;
    }
    for (int j = 0; j <= p; j++) {
      int cs = s - i * (j + 1);
      int cp = p - j;
      if (cs < 0) continue;
      for (int k = min(cp, cs / i); k >= 0; k--) {
        int ccs = cs - k * i;
        if (cp > 0)
          dp[k] = C(ccs + cp - 1, cp - 1) * C(cp, k) % mod;
        else
          dp[k] = (cs == 0);
        for (int l = min(cp, cs / i); l > k; l--) {
          dp[k] = (dp[k] + (mod - C(l, k)) * dp[l]) % mod;
        }
      }
      ans = (ans + dp[0] * C(p, j) % mod * inv[j + 1]) % mod;
    }
    ways = (ways + C(s - i + p - 1, p - 1)) % mod;
  }
  cout << ans * pw(ways, mod - 2) % mod << endl;
}
