#include <bits/stdc++.h>
using namespace std;
const int N = 50005;
const int MOD = 998244353;
int p, s, r;
long long ans, fac[N], ifac[N];
long long bigMod(long long a, long long e) {
  if (e == -1) e = MOD - 2;
  long long ret = 1;
  while (e) {
    if (e & 1) ret = ret * a % MOD;
    a = a * a % MOD, e >>= 1;
  }
  return ret;
}
inline long long comb(long long x, long long y) {
  if (x < y or x < 0 or y < 0) return 0;
  return fac[x] * (ifac[y] * ifac[x - y] % MOD) % MOD;
}
inline long long get(long long x, long long y) {
  if (y == 0) return x == 0 ? 1 : 0;
  return comb(x + y - 1, y - 1);
}
long long way(int sum, int pos, int up) {
  long long tot = 0;
  for (int i = 0; i <= pos and i * up <= sum; ++i) {
    long long add = comb(pos, i) * get(sum - i * up, pos);
    if (i & 1) {
      tot -= add;
      if (tot < 0) tot += MOD;
    } else {
      tot += add;
      if (tot >= MOD) tot -= MOD;
    }
  }
  return tot;
}
int main() {
  fac[0] = 1;
  for (int i = 1; i < N; ++i) fac[i] = fac[i - 1] * 1LL * i % MOD;
  ifac[N - 1] = bigMod(fac[N - 1], -1);
  for (int i = N - 1; i; --i) ifac[i - 1] = ifac[i] * 1LL * i % MOD;
  cin >> p >> s >> r;
  for (int k = 1; k <= p; ++k) {
    long long inv = bigMod(k, -1);
    for (int x = r; x * k <= s; ++x) {
      long long add = comb(p - 1, k - 1) * way(s - x * k, p - k, x) % MOD;
      add = add * inv % MOD;
      ans += add;
      if (ans >= MOD) ans -= MOD;
    }
  }
  ans = ans * bigMod(get(s - r, p), -1) % MOD;
  cout << ans << '\n';
  return 0;
}
