#include <bits/stdc++.h>
const int mod = 998244353, maxn = 100005;
int p, s, r, ans, all;
int fac[maxn], nfac[maxn], inv[maxn], mul[2];
inline int C(int n, int m) {
  return n < m ? 0 : 1ll * fac[n] * nfac[m] % mod * nfac[n - m] % mod;
}
int ksm(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod, b >>= 1;
  }
  return res;
}
int calc(int ps, int ss, int lim) {
  if (ps == 0) return ss == 0;
  int res = 0;
  for (int i = 0; i <= ps && i * lim <= ss; i++)
    res = (res + 1ll * mul[i & 1] * C(ps, i) % mod *
                     C(ss - i * lim + ps - 1, ps - 1) % mod) %
          mod;
  return res;
}
int main() {
  fac[0] = fac[1] = nfac[0] = nfac[1] = inv[1] = mul[0] = 1, mul[1] = mod - 1;
  for (int i = 2; i <= 100000; i++)
    fac[i] = 1ll * fac[i - 1] * i % mod,
    inv[i] = mod - 1ll * (mod / i) * inv[mod % i] % mod,
    nfac[i] = 1ll * nfac[i - 1] * inv[i] % mod;
  scanf("%d%d%d", &p, &s, &r);
  for (int i = r; i <= s; i++)
    for (int j = 1; j <= p && j * i <= s; j++)
      ans = (ans + 1ll * C(p - 1, j - 1) * calc(p - j, s - j * i, i) % mod *
                       inv[j] % mod) %
            mod;
  all = C(s - r + p - 1, p - 1);
  printf("%d\n", 1ll * ans * ksm(all, mod - 2) % mod);
  return 0;
}
