#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = 0;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
  return f ? s : -s;
}
const int Mod = 998244353, N = 5e3 + 10;
int power(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 p, s, r, fac[N], inv[N];
void prework(int n) {
  fac[0] = inv[0] = 1;
  for (register int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % Mod;
  inv[n] = power(fac[n], Mod - 2);
  for (register int i = n - 1; i; --i)
    inv[i] = 1ll * inv[i + 1] * (i + 1) % Mod;
}
int C(int n, int m) {
  if (m > n || n < 0 || m < 0) return 0;
  return 1ll * fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
int F(int x, int y, int t) {
  if (x == 0) return 1;
  if (x < 0) return 0;
  int res = 0, p = 1;
  for (register int i = 0; i <= y; ++i, p = Mod - p)
    res = 1ll *
          (res + 1ll * p * C(y, i) % Mod * C(x - t * i + y - 1, y - 1) % Mod) %
          Mod;
  return res;
}
int main() {
  prework(5000);
  p = read();
  s = read();
  r = read();
  int ans = 0;
  for (register int t = r; t <= s; ++t)
    for (register int i = 1; i <= p; ++i) {
      if ((p - i) * (t - 1) + i * t < s) continue;
      ans = 1ll *
            (ans + 1ll * C(p - 1, i - 1) * F(s - i * t, p - i, t) % Mod *
                       inv[i] % Mod * fac[i - 1] % Mod) %
            Mod;
    }
  printf("%lld\n", 1ll * ans * power(C(s - r + p - 1, p - 1), Mod - 2) % Mod);
  return 0;
}
