#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int p, s, r, fac[10005], ifac[10005];
int Pow(int x, int k) {
  int ret = 1;
  while (k) {
    if (k & 1) ret = 1ll * ret * x % mod;
    k >>= 1;
    x = 1ll * x * x % mod;
  }
  return ret;
}
int C(int n, int m) {
  if (n < m) return 0;
  return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int f(int sum, int n, int lim) {
  if (lim < 0) return 0;
  if (sum == 0) return 1;
  if (!n) return 0;
  int ans = 0;
  for (int i = 0, coef = 1; i * (lim + 1) <= sum && i <= n;
       i++, coef = mod - coef)
    ans = (ans +
           1ll * coef * C(n, i) % mod * C(sum - i * (lim + 1) + n - 1, n - 1)) %
          mod;
  return ans;
}
int main() {
  scanf("%d%d%d", &p, &s, &r);
  if (p == 1) puts("1"), exit(0);
  fac[0] = 1;
  for (int i = 1; i <= 10000; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  ifac[10000] = Pow(fac[10000], mod - 2);
  for (int i = 9999; ~i; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
  int ans = 0, tot = 0;
  for (int i = r; i <= s; i++) {
    for (int j = 0; i * (j + 1) <= s && j < p; j++) {
      ans = (ans + 1ll * C(p - 1, j) * f(s - i * (j + 1), p - j - 1, i - 1) %
                       mod * Pow(j + 1, mod - 2)) %
            mod;
    }
  }
  for (int i = r; i <= s; i++) tot = (tot + C(s - i + p - 2, p - 2)) % mod;
  ans = 1ll * ans * Pow(tot, mod - 2) % mod;
  cout << ans << "\n";
}
