#include <bits/stdc++.h>
using namespace std;
const long long N = 5505;
long long s, r, p, ans, mod = 998244353, c[N][N];
long long ksm(long long a, long long b) {
  long long ans = 1;
  for (; b; b >>= 1) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
  }
  return ans;
}
long long f(long long s, long long p, long long m) {
  if (!s) return 1;
  long long ans = 0, tmp = 0;
  for (long long i = 0; i <= p; i++) {
    if (s - i * m + p - 1 < p - 1)
      tmp = 0;
    else
      tmp = c[p][i] % mod * c[s - i * m + p - 1][p - 1] % mod;
    if (i & 1)
      ans = (ans - tmp + mod) % mod;
    else
      ans = (ans + tmp) % mod;
  }
  return ans;
}
int main() {
  scanf("%lld%lld%lld", &p, &s, &r);
  c[0][0] = 1;
  for (long long i = 1; i <= s + p; i++) {
    c[i][0] = 1;
    for (long long j = 1; j <= i && j <= p; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
  for (long long i = r; i <= s; i++) {
    for (long long j = 1; j <= p; j++) {
      if ((p - j) * (i - 1) + i * j < s || s - i * j < 0) continue;
      ans = (ans + c[p - 1][j - 1] * f(s - i * j, p - j, i) % mod *
                       ksm(j, mod - 2) % mod) %
            mod;
    }
  }
  printf("%lld", ans * ksm(c[s - r + p - 1][p - 1], mod - 2) % mod);
}
