#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 5001;
int ans;
int ni[101];
int a[N * 2], nia[N * 2], f[N + 10];
int n, r, s;
long long calc(long long x, long long y) {
  long long z = 1;
  while (y) {
    if (y & 1) z = z * x % mod;
    x = x * x % mod, y /= 2;
  }
  return z;
}
long long CC(int x, int y) {
  return y < 0 || x < y ? 0 : 1ll * a[x] * nia[y] % mod * nia[x - y] % mod;
}
int add(int x, int y) {
  x += y;
  return x >= mod ? x - mod : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + mod : x;
}
int mul(int x, int y) { return 1ll * x * y % mod; }
int get(int n, int s, int k) {
  if (s < 0 || s > k * n) return 0;
  if (!n && !s) return 1;
  int v = 0;
  int nn = (k >= 0 ? max(min(n, s / (k + 1)), 0) + 1 : 0);
  for (int i = 0; i <= nn; i++) f[i] = 0;
  for (int i = nn; i >= 0; i--) {
    f[i] = mul(CC(n, i), CC(s - (k + 1) * i + n - 1, n - 1));
    for (int j = i + 1; j <= nn; j++) f[i] = sub(f[i], mul(f[j], CC(j, i)));
  }
  v = f[0];
  return v;
}
int main() {
  scanf("%d %d %d", &n, &s, &r);
  a[0] = 1;
  for (int i = 1; i < N * 2; i++) a[i] = 1ll * a[i - 1] * i % mod;
  nia[N * 2 - 1] = calc(a[N * 2 - 1], mod - 2);
  for (int i = N * 2 - 2; i >= 0; i--)
    nia[i] = 1ll * nia[i + 1] * (i + 1) % mod;
  ni[0] = ni[1] = 1;
  for (int i = 2; i <= n; i++)
    ni[i] = 1ll * ni[mod % i] * (mod - mod / i) % mod;
  for (int i = n; i >= 1; i--) {
    for (int j = r; j * i <= s; j++)
      ans = (ans + 1ll * CC(n - 1, i - 1) *
                       get(n - i, s - j * i, min(j - 1, s - j * i)) % mod *
                       ni[i]) %
            mod;
  }
  long long all = 0;
  if (n == 1 && r <= s) all = 1;
  for (int j = r; j <= s; j++) all = add(all, CC(s - j + n - 2, n - 2));
  printf("%lld\n", ans * calc(all, mod - 2) % mod);
  return 0;
}
