#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long n = 0;
  bool b = 0;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') b = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    n = (n << 1) + (n << 3) + (c ^ 48);
    c = getchar();
  }
  return b ? -n : n;
}
const long long N = 5e3 + 7, mod = 998244353;
long long inv[N], fac[N], c[N][107];
long long S, S2;
long long C(long long n, long long m) {
  if (n < m) return 0;
  if (m == 0) return 1;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
long long Pow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return res;
}
inline long long calc(long long n, long long m, long long x) {
  long long S = 0;
  for (long long i = 0; i <= m && i * x <= n; ++i) {
    long long s = 1ll * c[m][i] * c[n - x * i + m - 1][m - 1] % mod;
    S += i & 1 ? -s : s;
  }
  return (S % mod + mod) % mod;
}
signed main() {
  inv[0] = inv[1] = fac[0] = 1;
  for (long long i = 1; i <= N - 7; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  for (long long i = 2; i <= N - 7; i++)
    inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
  for (long long i = 1; i <= N - 7; i++)
    inv[i] = 1ll * inv[i] * inv[i - 1] % mod;
  long long p = read(), s = read(), r = read();
  if (p == 1) return puts("1"), 0;
  for (long long i = 0; i <= N - 7; i++) c[i][0] = 1;
  for (long long i = 0; i <= N - 7; i++)
    for (long long j = 1; j <= min(i, 1ll * 100); j++) c[i][j] = C(i, j);
  for (long long x = r; x <= s; x++) {
    if (x * p < s) continue;
    for (long long i = 1; i <= p; i++) {
      if (i * x > s || (p - i) * (x - 1) + i * x < s) continue;
      if (i == p) {
        S = (S + (i * x == s ? Pow(i, mod - 2) : 0)) % mod;
        continue;
      }
      S = (S + 1ll * c[p - 1][i - 1] * calc(s - i * x, p - i, x) % mod *
                   Pow(i, mod - 2)) %
          mod;
    }
  }
  S2 = c[s - r + p - 1][p - 1];
  printf("%lld\n", 1ll * S * Pow(S2, mod - 2) % mod);
}
