#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = 998244353;
using namespace std;
template <class T>
void smin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
  if (a < val) a = val;
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  bool first = true;
  os << "[";
  for (auto i : v) {
    if (!first) os << ", ";
    os << i;
    first = false;
  }
  return os << "]";
}
const long long N = 5 * 1e3 + 110;
long long NCR[N][N];
long long p, s, r;
long long nCr(long long n, long long r) {
  if (n < r or r < 0 or n < 0) return 0;
  return NCR[n][r];
}
long long solve(long long score, long long cnt) {
  if (s - cnt * score < 0) return 0;
  if (p - cnt == 0) return (score * cnt) == s;
  if (cnt == 0) return 0;
  long long ans = 0;
  for (long long i = 0, flag = 1; i <= p - cnt; ++i, flag *= -1) {
    long long tt = flag * nCr(p - cnt, i);
    if (tt < 0) tt += mod;
    tt %= mod;
    long long tt2 = nCr(s - score * cnt - i * score + p - cnt - 1, p - cnt - 1);
    ans += tt * tt2 % mod;
    ans %= mod;
  }
  ans %= mod;
  return ans;
}
long long power(long long a, long long b, long long m = mod) {
  if (b < 0) b += m - 1;
  long long r = 1;
  while (b) {
    if (b & 1) r = (r * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return r;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> p >> s >> r;
  for (long long i = 0; i <= 5100; ++i) {
    for (long long j = 0; j <= i; ++j) {
      if (j == 0 or j == i) {
        NCR[i][j] = 1;
      } else {
        NCR[i][j] = NCR[i - 1][j - 1] + NCR[i - 1][j];
        if (NCR[i][j] >= mod) NCR[i][j] -= mod;
      }
    }
  }
  assert(s - r + p - 1 >= p - 1);
  long long den = nCr(s - r + p - 1, p - 1);
  long long ans = 0;
  for (long long score = r; score <= s; ++score) {
    for (long long cnt = 1; cnt <= p; ++cnt) {
      long long tmp = solve(score, cnt);
      tmp = tmp * nCr(p - 1, cnt - 1) % mod;
      tmp = tmp * power(cnt, -1) % mod;
      ans += tmp;
      if (ans < 0) ans += mod;
      ans %= mod;
    }
  }
  ans = (ans * power(den, -1)) % mod;
  cout << ans;
  return 0;
}
