#include <bits/stdc++.h>
using namespace std;
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline T read() {
  register T sum(0), fg(1);
  register char ch(getchar());
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fg = -1;
  for (; isdigit(ch); ch = getchar()) sum = sum * 10 - '0' + ch;
  return sum * fg;
}
const int MOD = 998244353;
namespace MATH {
const int N = (int)1e4;
inline int fpm(int x, int y) {
  int res = 1;
  for (; y; y >>= 1, x = (long long)x * x % MOD)
    if (y & 1) res = (long long)res * x % MOD;
  return res;
}
int fac[N + 5], ifac[N + 5];
inline int C(int n, int m) {
  return n < m ? 0 : (long long)fac[n] * ifac[n - m] % MOD * ifac[m] % MOD;
}
inline void init() {
  fac[0] = 1;
  for (int i = 1; i <= N; ++i) fac[i] = (long long)fac[i - 1] * i % MOD;
  ifac[N] = fpm(fac[N], MOD - 2);
  for (int i = N - 1; i >= 0; --i)
    ifac[i] = (long long)ifac[i + 1] * (i + 1) % MOD;
}
}  // namespace MATH
using MATH::C;
using MATH::fpm;
int n, s, r;
inline void input() { n = read<int>(), s = read<int>(), r = read<int>(); }
inline int div_into(int N, int M) {
  return N == 0 ? 1 : (M == 0 ? 0 : C(N + M - 1, M - 1));
}
inline void solve() {
  int sum = 0, ans = 0;
  for (int k = r; k <= s; ++k) {
    (sum += div_into(s - k, n - 1)) %= MOD;
    for (int t = 0; t <= n - 1 && k * (t + 1) <= s; ++t) {
      const int N = n - 1 - t, S = s - k * (t + 1);
      int res = 0;
      for (int i = 0; i <= N; ++i)
        if (S >= k * i)
          (res += (long long)(i & 1 ? -1 : +1) * C(N, i) *
                  div_into(S - k * i, N) % MOD) %= MOD;
      (ans += (long long)res * C(n - 1, t) % MOD * fpm(t + 1, MOD - 2) % MOD) %=
          MOD;
    }
  }
  ans = (long long)ans * fpm(sum, MOD - 2) % MOD;
  printf("%d\n", (ans + MOD) % MOD);
}
int main() {
  MATH::init();
  input();
  solve();
  return 0;
}
