#include <bits/stdc++.h>
using namespace std;
namespace my_std {
const long long inf = 0x3f3f3f3f;
const long long inff = 1e15;
inline long long read() {
  long long sum = 0, f = 1;
  char ch = 0;
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    sum = (sum << 1) + (sum << 3) + (ch ^ 48);
    ch = getchar();
  }
  return sum * f;
}
inline void write(long long x) {
  if (x < 0) {
    x = -x;
    putchar('-');
  }
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  putchar('\n');
}
inline void writesp(long long x) {
  write(x);
  putchar(' ');
}
}  // namespace my_std
using namespace my_std;
const long long N = 5500, mod = 998244353;
long long p, r, s, mul[N], inv[N], c[N][N], ans;
inline long long ksmod(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans * a) % mod;
    }
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
inline long long C(long long n, long long m) {
  if (m > n || m < 0 || n < 0) return 0;
  long long res = inv[m] * inv[n - m] % mod;
  res = res * mul[n] % mod;
  return res;
}
inline void init() {
  mul[0] = inv[0] = 1;
  for (long long i = 1; i <= p + s; i++) mul[i] = (mul[i - 1] * i) % mod;
  inv[p + s] = ksmod(mul[p + s], mod - 2);
  for (long long i = p + s - 1; i; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
}
inline long long f(long long s, long long p, long long m) {
  if (s == 0 && p == 0) return 1;
  long long ans = 0, tmp = 1;
  for (register long long i = (0); i <= (p); i++) {
    if (s + p - 1 - i * (m + 1) < 0) break;
    ans = (ans + tmp * C(p, i) % mod * C(s + p - 1 - i * (m + 1), p - 1) % mod +
           mod) %
          mod;
    tmp *= -1;
  }
  return ans;
}
int main(void) {
  p = read(), s = read(), r = read();
  init();
  for (register long long t = (r); t <= (s); t++)
    for (register long long q = (1); q <= (p); q++)
      ans = (ans + (C(p - 1, q - 1) * ksmod(q, mod - 2)) % mod *
                       f(s - q * t, p - q, t - 1)) %
            mod;
  ans = (ans * ksmod(C(s - r + p - 1, p - 1), mod - 2)) % mod;
  writeln(ans);
  return 0;
}
