#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353, inv[5050], c[5050 + 10][5050 + 10], p, s, r, ans;
void init() {
  inv[1] = 1;
  for (long long i = 2; i <= p; i++)
    inv[i] = mod - (mod / i) * inv[mod % i] % mod;
  c[0][0] = 1;
  for (long long i = 1; i <= 5050; i++) {
    c[0][i] = 1;
    for (long long j = 1; j <= i; j++)
      c[j][i] = (c[j][i - 1] + c[j - 1][i - 1]) % mod;
  }
}
long long ksm(long long x, long long y) {
  long long tot = 1, tmp = x;
  while (y) {
    if (y & 1) tot = tot * tmp % mod;
    tmp = tmp * tmp % mod;
    y >>= 1;
  }
  return tot;
}
long long C(long long a, long long b) {
  if (a > b || a < 0 || b < 0) return 0;
  return c[a][b];
}
long long jj(long long sum, long long x, long long lim) {
  if (sum == 0) return 1;
  if (sum < 0) return 0;
  long long tot = 0;
  for (long long i = 0; i <= x; i++)
    tot = (tot + ((i & 1) ? 998244352 : 1) * C(i, x) % mod *
                     C(x - 1, sum - i * lim + x - 1)) %
          mod;
  return tot;
}
signed main() {
  cin >> p >> s >> r;
  init();
  for (long long i = r; i <= s; i++) {
    for (long long j = 1; j <= p; j++) {
      if ((p - j) * (i - 1) + i * j < s) continue;
      ans = (ans +
             1LL * jj(s - i * j, p - j, i) * C(j - 1, p - 1) % mod * inv[j]) %
            mod;
    }
  }
  cout << 1LL * ans * ksm(C(p - 1, s - r + p - 1), mod - 2) % mod;
}
