#include <bits/stdc++.h>
using namespace std;
const int maxn = 5020;
const int maxm = 120;
const int mod = 998244353;
int p, s, r, ans;
int fac[maxn], inv[maxn];
int fast_pow(int now, int pw) {
  int bit = 1, ans = 1, dt = now;
  while (bit <= pw) {
    if (bit & pw) {
      ans = 1ll * ans * dt % mod;
    }
    bit <<= 1;
    dt = 1ll * dt * dt % mod;
  }
  return ans;
}
int C(int n, int m) {
  if (n < m || m < 0) return 0;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int func(int tot, int per, int lim) {
  int res = 0;
  if (per == 0 && tot == 0) return 1;
  if (tot < 0 || per == 0 || lim == -1) return 0;
  for (int i = 0; i <= per; i++) {
    int dr = (i % 2 == 0 ? 1 : -1);
    res += dr *
           (1ll * C(per, i) * C(tot - i * (lim + 1) + per - 1, per - 1) % mod);
    res %= mod;
    res += mod;
    res %= mod;
  }
  return res;
}
void work() {
  if (p == 1) {
    puts("1");
    return;
  }
  for (int i = r; i <= s; i++) {
    for (int j = 1; j <= p; j++) {
      ans += 1ll * C(p - 1, j - 1) * fast_pow(j, mod - 2) % mod *
             func(s - j * i, p - j, i - 1) % mod;
      ans %= mod;
    }
  }
  int a2 = 0;
  for (int i = r; i <= s; i++) a2 += C(s - i + p - 2, p - 2), a2 %= mod;
  ans = 1ll * ans * fast_pow(a2, mod - 2) % mod;
  printf("%d\n", ans);
}
int main() {
  scanf("%d%d%d", &p, &s, &r);
  fac[0] = 1;
  for (int i = 1; i <= 5010; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[5010] = fast_pow(fac[5010], mod - 2);
  for (int i = 5009; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  work();
  return 0;
}
