#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long powM(long long a, int t = mod - 2) {
  long long ret = 1;
  while (t) {
    if (t & 1) ret = ret * a % mod;
    a = a * a % mod;
    t >>= 1;
  }
  return ret;
}
long long fac[10500], ifac[10500], inv[10500];
long long C(int n, int m) { return fac[n] * ifac[n - m] % mod * ifac[m] % mod; }
void Init(int n) {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
  ifac[n] = powM(fac[n]);
  for (int i = n; i; i--) ifac[i - 1] = ifac[i] * i % mod;
  for (int i = 1; i <= n; i++) inv[i] = ifac[i] * fac[i - 1] % mod;
}
long long S(int n, int m, int c) {
  if (!n) return !m;
  long long ret = 0;
  for (int i = 0; i <= n && m - i * c + n > 0; i++) {
    int sav = C(n, i) * C(m - (c + 1) * i + n - 1, n - 1) % mod;
    ret += (i & 1) ? -sav : sav;
  }
  return ret % mod;
}
int main() {
  int p, r, s;
  scanf("%d%d%d", &p, &s, &r);
  Init(s + r + p);
  long long ans = 0;
  for (int k = r; k <= s; k++)
    for (int t = 1; t <= p && t * k <= s; t++)
      ans =
          (ans + inv[t] * C(p - 1, t - 1) % mod * S(p - t, s - t * k, k - 1)) %
          mod;
  printf("%lld", ans * powM(C(s - r + p - 1, p - 1)) % mod);
  return 0;
}
