#include <bits/stdc++.h>
using namespace std;
const long long N = 10000, Mod = 998244353;
long long p, s, r, ans = 0;
long long fac[10010] = {}, inac[10010] = {};
inline long long Add(long long a, long long b) {
  return a + b >= Mod ? a + b - Mod : a + b;
}
inline long long Sub(long long a, long long b) {
  return a - b >= 0 ? a - b : a - b + Mod;
}
inline long long Mul(long long a, long long b) { return 1ll * a * b % Mod; }
inline long long Pow(long long a, long long b) {
  long long res = 1;
  for (; b; b >>= 1, a = Mul(a, a))
    if (b & 1) res = Mul(res, a);
  return res;
}
inline long long Inv(long long a) { return Pow(a, Mod - 2); }
inline long long C(long long n, long long m) {
  return n < m || m < 0 ? 0 : Mul(fac[n], Mul(inac[m], inac[n - m]));
}
inline long long f(long long n, long long m, long long lim) {
  if (n == 0 && m == 0) return 1;
  long long res = 0;
  for (long long i = 0; i <= m; i++) {
    res = i & 1 ? Sub(res, Mul(C(m, i), C(n - (lim + 1) * i + m - 1, m - 1)))
                : Add(res, Mul(C(m, i), C(n - (lim + 1) * i + m - 1, m - 1)));
  }
  return res;
}
void pret() {
  fac[0] = 1;
  for (long long i = 1; i <= N; i++) fac[i] = Mul(fac[i - 1], i);
  inac[N] = Inv(fac[N]);
  for (long long i = N - 1; i >= 0; i--) inac[i] = Mul(inac[i + 1], i + 1);
  return;
}
signed main() {
  pret();
  scanf("%lld%lld%lld", &p, &s, &r);
  for (long long i = r; i <= s; i++)
    for (long long j = 1; j <= p; j++) {
      ans = Add(ans,
                Mul(Mul(C(p - 1, j - 1), f(s - i * j, p - j, i - 1)), Inv(j)));
    }
  printf("%lld", Mul(ans, Inv(C(s - r + p - 1, p - 1))));
  return 0;
}
