#include <bits/stdc++.h>
using namespace std;
const long long N = 5e3 + 5, M = 110, mod = 998244353;
long long p, s, r, c[N + M][M], ans;
long long mul(long long x, long long n, long long mod) {
  long long ans = mod != 1;
  for (x %= mod; n; n >>= 1, x = x * x % mod)
    if (n & 1) ans = ans * x % mod;
  return ans;
}
long long solve(long long s, long long p, long long m) {
  if (s < 0) return 0;
  if (!s) return 1;
  long long ans = 0, tmp = 0;
  for (long long i = 0; i <= p; i++) {
    if (s - i * m + p - 1 < p - 1)
      tmp = 0;
    else
      tmp = c[p][i] % mod * c[s - i * m + p - 1][p - 1] % mod;
    if (i & 1)
      ans = (ans - tmp + mod) % mod;
    else
      ans = (ans + tmp) % mod;
  }
  return ans;
}
signed main() {
  scanf("%lld%lld%lld", &p, &s, &r), c[0][0] = 1;
  for (long long i = 1; i <= s + p; i++) {
    c[i][0] = 1;
    for (long long j = 1; j <= i && j <= p; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
  for (long long t = r; t <= s; t++)
    for (long long q = 1; q <= p; q++) {
      if ((p - q) * (t - 1) + t * q < s) continue;
      ans = (ans + c[p - 1][q - 1] % mod * mul(q, mod - 2, mod) *
                       solve(s - t * q, p - q, t) % mod) %
            mod;
    }
  ans = ans * mul(c[s - r + p - 1][p - 1], mod - 2, mod) % mod;
  printf("%lld\n", ans);
  return 0;
}
