#include <bits/stdc++.h>
using namespace std;
long long n, s, r;
const long long mod = 998244353;
long long dp[105][5005], pw[105][5005], fact[50005], invfact[50005];
long long inv(long long a) {
  long long b = mod - 2;
  long long rez = 1;
  while (b) {
    if (b & 1) rez = (rez * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return rez;
}
long long comb(long long a, long long b) {
  if (a < b) return 0;
  long long rez = fact[a];
  rez = (rez * invfact[b]) % mod;
  rez = (rez * invfact[a - b]) % mod;
}
long long stars_and_bars(long long bile, long long urne) {
  return comb(bile + urne - 1, urne - 1);
}
int main() {
  cin >> n >> s >> r;
  for (long long i = 1; i <= n; i++) {
    pw[i][0] = 1;
    for (int j = 1; j <= s; j++) pw[i][j] = (pw[i][j - 1] * 1LL * i) % mod;
  }
  fact[0] = 1;
  invfact[0] = 1;
  for (long long i = 1; i <= 50000; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    invfact[i] = inv(fact[i]) % mod;
  }
  for (int i = 1; i <= n; i++)
    for (int x = 1; x <= s + 1; x++) {
      bool ok = 0;
      if (i == 2 && x == 4) ok = 1;
      long long lft = s - (n - i) * x;
      for (int nums = 0; nums <= i; nums++) {
        long long suma = lft - nums * x;
        if (suma < 0) break;
        long long val = (stars_and_bars(suma, i) * comb(i, nums)) % mod;
        if (nums % 2 == 0) {
          dp[i][x] = (dp[i][x] + val);
          if (dp[i][x] >= mod) dp[i][x] -= mod;
        } else {
          dp[i][x] = (dp[i][x] - val);
          if (dp[i][x] < 0) dp[i][x] += mod;
        }
      }
    }
  long long ans = 0;
  long long total = stars_and_bars(s - r, n);
  for (int nr = 1; nr < n; nr++)
    for (int val = r; val <= s; val++) {
      long long lft = n - nr;
      long long slft = s - val * nr;
      if (slft < 0) continue;
      long long states = (dp[lft][val] * comb(n - 1, nr - 1)) % mod;
      states = (states * inv(nr)) % mod;
      states = (states * inv(total)) % mod;
      ans = (ans + states) % mod;
    }
  if (s % n == 0 && s / n >= r) {
    long long val = (inv(n) * inv(total)) % mod;
    ans = (ans + val) % mod;
  }
  cout << ans;
  return 0;
}
