#include <bits/stdc++.h>
using namespace std;
long long p, r, s, fac[11111], facinv[11111], inv[11111], ans;
long long pw(long long a, long long b) {
  long long res = 1;
  for (; b; b >>= 1, (a *= a) %= 998244353)
    if (b & 1) (res *= a) %= 998244353;
  return res;
}
long long C(long long a, long long b) {
  if (a < b) return 0;
  return fac[a] * facinv[b] % 998244353 * facinv[a - b] % 998244353;
}
long long calc(long long s, long long p, long long m) {
  if (p == 0 && s == 0) return 1;
  if (p == 0 && s != 0) return 0;
  long long res = 0;
  for (long long i = 0; i <= p; i++) {
    (res += (i & 1 ? -1 : 1) * C(p, i) % 998244353 *
            C(s - i * (m + 1) + p - 1, p - 1) % 998244353) %= 998244353;
    (res += 998244353) %= 998244353;
  }
  return res;
}
signed main() {
  scanf("%lld%lld%lld", &p, &s, &r);
  fac[0] = 1;
  for (long long i = 1; i <= s; i++) fac[i] = fac[i - 1] * i % 998244353;
  inv[0] = inv[1] = 1;
  for (long long i = 2; i <= s; i++)
    inv[i] = inv[998244353 % i] * (998244353 - 998244353 / i) % 998244353;
  facinv[0] = facinv[1] = 1;
  for (long long i = 2; i <= s; i++)
    facinv[i] = facinv[i - 1] * inv[i] % 998244353;
  for (long long i = r; i <= s; i++)
    for (long long j = 1; j <= p && j * i <= s; j++)
      (ans += C(p - 1, j - 1) * inv[j] % 998244353 *
              calc(s - j * i, p - j, i - 1) % 998244353) %= 998244353;
  (ans *= pw(C(s - r + p - 1, p - 1), 998244353 - 2)) %= 998244353;
  printf("%lld\n", ans);
  return 0;
}
