#include <bits/stdc++.h>
using namespace std;
const int N = 10005, mod = 998244353;
int fac[N], ni[N], inv[N], n, r, S, ans, P;
int qm(int x) { return x >= mod ? x - mod : x; }
int ksm(int x, int y) {
  int re = 1;
  for (; y; y >>= 1, x = 1LL * x * x % mod)
    if (y & 1) re = 1LL * re * x % mod;
  return re;
}
int C(int d, int u) {
  if (d < 0 || u < 0) return 0;
  return 1LL * fac[d] * ni[u] % mod * ni[d - u] % mod;
}
int f(int n, int m, int lim) {
  if (n == 0 && m == 0) return 1;
  int re = 0;
  for (register int i = 0; i <= m; ++i) {
    int kl = 1LL * C(m, i) * C(n - (lim + 1) * i + m - 1, m - 1) % mod;
    if (i & 1)
      re = qm(re - kl + mod);
    else
      re = qm(re + kl);
  }
  return re;
}
int main() {
  scanf("%d%d%d", &n, &S, &r);
  if (n == 1) {
    puts("1");
    return 0;
  }
  fac[0] = 1;
  for (register int i = 1; i <= n + S; ++i) fac[i] = 1LL * fac[i - 1] * i % mod;
  ni[n + S] = ksm(fac[n + S], mod - 2);
  for (register int i = n + S - 1; i >= 0; --i)
    ni[i] = 1LL * ni[i + 1] * (i + 1) % mod;
  inv[0] = inv[1] = 1;
  for (register int i = 2; i <= n; ++i)
    inv[i] = 1LL * (mod - mod / i) * inv[mod % i] % mod;
  for (register int i = r; i <= S; ++i) {
    for (register int j = 1; i * j <= S && j <= n; ++j) {
      int kl = 1LL * C(n - 1, j - 1) * f(S - i * j, n - j, i - 1) % mod;
      ans = qm(ans + 1LL * kl * inv[j] % mod);
    }
    P = qm(P + C(S - i + n - 2, n - 2));
  }
  printf("%lld\n", 1LL * ans * ksm(P, mod - 2) % mod);
  return 0;
}
