#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 5e3 + 200;
int p, s, r;
long long c[N][N];
long long ans;
void init() {
  c[0][0] = 1;
  for (int i = 1; i < N; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
}
long long KSM(long long a, long long b) {
  long long ret = 1LL;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
long long C(int n, int m) {
  if (n < 0 || m < 0 || n < m) return 0;
  return c[n][m];
}
long long calc(long long s, long long p, long long m) {
  if (p == 0 && s == 0) return 1;
  long long ret = 0;
  for (int i = 0, sign = 1; i <= p; i++) {
    ret += sign * (C(p, i) * C(s + p - 1 - i * (m + 1), p - 1) % mod) % mod;
    ret = (ret + mod) % mod;
    sign *= -1;
  }
  return ret;
}
int main() {
  init();
  scanf("%d%d%d", &p, &s, &r);
  for (int x = r; x <= s; x++)
    for (int k = 1; k <= p; k++) {
      (ans += ((C(p - 1, k - 1) * KSM(k, mod - 2) % mod) *
               calc(s - k * x, p - k, x - 1)) %
              mod) %= mod;
    }
  ans *= KSM(C(s + p - 1 - r, p - 1), mod - 2);
  ans %= mod;
  printf("%lld", ans);
  return 0;
}
