#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int N = 1e6 + 10;
const long long mod2 = 1e9 + 7;
const long long mod = 998244353;
const long long inf = 8e18;
const int LOG = 22;
long long pw(long long a, long long b, long long M) {
  return (!b ? 1
             : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M
                      : pw(a * a % M, b / 2, M)));
}
long long first[N], I[N];
inline long long E(long long r, long long n) {
  if (r > n || r < 0) return 0ll;
  return first[n] * I[r] % mod * I[n - r] % mod;
}
long long calc(int n, int m, int s) {
  if (n == 0 && m == 0) return 1;
  long long ret = 0;
  for (int i = 0; i <= n; i++) {
    if (m < s * i) continue;
    long long z = (i % 2 == 0 ? 1 : -1);
    long long cu = E(i, n) * E(n - 1, m - s * i + n - 1) % mod;
    ret = (ret + z * cu + 2 * mod) % mod;
  }
  return ret;
}
int main() {
  int n, second, R;
  first[0] = 1;
  for (int i = 1; i < N; i++) {
    first[i] = first[i - 1] * i % mod;
  }
  I[N - 1] = pw(first[N - 1], mod - 2, mod);
  for (int i = N - 2; ~i; i--) I[i] = I[i + 1] * (i + 1) % mod;
  scanf("%d%d%d", &n, &second, &R);
  if (n == 1) {
    return !printf("1");
  }
  long long kol = 0, win = 0;
  for (int T = R; T <= second; T++) {
    for (int i = 0; i < n; i++) {
      if ((i + 1) * T > second) continue;
      long long cu = E(i, n - 1);
      cu = cu * calc(n - i - 1, second - (i + 1) * T, T) % mod;
      win = (win + cu * pw(i + 1, mod - 2, mod)) % mod;
    }
    kol = (kol + E(n - 2, second - T + n - 2)) % mod;
  }
  long long tot = win * pw(kol, mod - 2, mod) % mod;
  printf("%lld ", tot);
  return 0;
}
