#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 10005, P = 998244353;
ll qpow(ll a, ll b) {
  ll ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % P;
    a = a * a % P;
    b >>= 1;
  }
  return ret;
}
inline ll inv(int a) { return qpow(a, P - 2); }
int n, s, r;
ll fac[N], ifac[N];
inline ll C(int a, int b) {
  return a < b ? 0 : fac[a] * ifac[b] % P * ifac[a - b] % P;
}
inline ll g(int s, int p, int m) {
  if (s < 0 || m < 0 || p < 0) return 0;
  if (p == 0) return 1;
  ll ret = 0;
  for (int i = 0; i <= p; i++)
    ret = (ret + ((i & 1) ? P - 1 : 1) * C(p, i) % P *
                     C(s + p - 1 - i * (m + 1), p - 1) % P) %
          P;
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> s >> r;
  fac[0] = 1;
  for (int i = 1; i <= s + n; i++) fac[i] = fac[i - 1] * i % P;
  ifac[s + n] = inv(fac[s + n]);
  for (int i = s + n; i > 0; --i) ifac[i - 1] = ifac[i] * i % P;
  ll ans = 0;
  for (int i = r; i <= s; i++)
    for (int j = 1; j <= n; j++)
      ans =
          (ans + C(n - 1, j - 1) * inv(j) % P * g(s - i * j, n - j, i - 1)) % P;
  cout << ans * inv(C(s - r + n - 1, n - 1)) % P << endl;
  return 0;
}
