#include <bits/stdc++.h>
using namespace std;
const int N = 5500, mod = 998244353;
int p, s, r, ans, fac[N], inv[N];
void exGCD(int a, int b, int &x, int &y) {
  if (!b) {
    x = 1, y = 0;
    return;
  }
  exGCD(b, a % b, y, x), y -= a / b * x;
}
int Inv(int x) {
  int xx, yy;
  exGCD(x, mod, xx, yy);
  return (xx % mod + mod) % mod;
}
void Prework() {
  fac[0] = inv[0] = 1;
  for (int i = 1; i <= 5200; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[5200] = Inv(fac[5200]);
  for (int i = 5199; i; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m) {
  if (n == m) return 1;
  if (n < m) return 0;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int Calc(int cnt, int lim, int tot) {
  int ret = C(tot + cnt - 1, cnt - 1);
  for (int i = 1, j; i <= cnt; i++, ret %= mod)
    j = i % 2 ? mod - 1 : 1, ret += 1ll * j * C(cnt, i) % mod *
                                    C(tot - i * lim + cnt - 1, cnt - 1) % mod;
  return (ret + mod) % mod;
}
int main() {
  scanf("%d%d%d", &p, &s, &r), Prework();
  for (int i = r; i <= s; i++)
    for (int j = 1; j <= p && i * j <= s; j++, ans %= mod)
      ans += 1ll * C(p - 1, j - 1) * Inv(j) % mod * Calc(p - j, i, s - i * j) %
             mod;
  printf("%lld", 1ll * ans * Inv(C(s - r + p - 1, p - 1)) % mod);
  return 0;
}
