#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
const int maxn = 5e3 + 7;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
long long f[maxn], inv[maxn];
long long qpow(long long a, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = res * a % mod;
    a = a * a % mod, k >>= 1;
  }
  return res;
}
long long comb(int n, int m) { return f[n] * inv[m] % mod * inv[n - m] % mod; }
long long cal(int s, int p, int x) {
  if (p == 0) return 1;
  long long res = 0;
  for (int i = 0; i <= p; ++i) {
    int ss = s - i * x;
    if (ss < 0) break;
    res =
        (res + ((i & 1) ? -1 : 1) * comb(p, i) * comb(ss + p - 1, p - 1) % mod +
         mod) %
        mod;
  }
  return res;
}
void solve() {
  int p = read(), s = read(), r = read();
  if (p == 1) return (void)printf("1\n");
  if (s == 0 && r == 0) return (void)printf("%lld\n", qpow(p, mod - 2));
  long long res = 0;
  for (int x = max((s - 1) / p + 1, r); x <= s; ++x) {
    for (int eq = 0; eq < p; ++eq) {
      long long ss = s - (eq + 1) * x;
      if (ss < 0) break;
      res = (res + comb(p - 1, eq) * cal(ss, p - eq - 1, x) % mod *
                       qpow(eq + 1, mod - 2)) %
            mod;
    }
  }
  printf("%lld\n", res * qpow(comb(s - r + p - 1, p - 1), mod - 2) % mod);
}
int main() {
  f[0] = f[1] = inv[0] = inv[1] = 1;
  for (int i = 2; i < maxn; ++i) f[i] = i * f[i - 1] % mod;
  for (int i = 2; i < maxn; ++i) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  for (int i = 2; i < maxn; ++i) inv[i] = inv[i - 1] * inv[i] % mod;
  int T = 1;
  while (T--) solve();
}
