#include <bits/stdc++.h>
using namespace std;
const int maxn = 5020, mod = 998244353;
int fac[maxn], ifac[maxn];
inline int mo(int x) {
  while (x >= mod) x -= mod;
  while (x < 0) x += mod;
  return x;
}
inline int muln(int x, int y) { return 1LL * x * y % mod; }
inline int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = muln(x, x))
    if (y & 1) ret = muln(ret, x);
  return ret;
}
inline int inv(int x) { return qpow(x, mod - 2); }
inline int C(int x, int y) {
  if (y > x) return 0;
  return muln(fac[x], muln(ifac[x - y], ifac[y]));
}
inline void init() {
  ifac[0] = fac[0] = 1;
  for (int i = 1; i <= 5001; ++i) {
    fac[i] = muln(fac[i - 1], i);
    ifac[i] = inv(fac[i]);
  }
}
inline int calc(int n, int s, int k) {
  if (n == 0) return s == 0;
  int ret = 0;
  for (int i = 0, sgn = 1; i <= n && i * k <= s; ++i, sgn = mod - sgn)
    ret = mo(ret + muln(sgn, muln(C(n, i), C(n + s - i * k - 1, n - 1))));
  return ret;
}
int main() {
  init();
  int n, s, r, ans = 0;
  scanf("%d%d%d", &n, &s, &r);
  for (int k = r; k <= s; ++k)
    for (int c = 1; c <= n && c * k <= s; ++c)
      ans = mo(ans +
               muln(muln(inv(c), C(n - 1, c - 1)), calc(n - c, s - c * k, k)));
  ans = muln(ans, inv(C(s - r + n - 1, n - 1)));
  printf("%d\n", ans);
  return 0;
}
