#include <bits/stdc++.h>
using namespace std;
inline int read() {
  register int x = 0;
  register char ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return x;
}
const long long MOD = 998244353;
long long c[5110][5110];
long long quick_pow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % MOD;
    b >>= 1;
    a = (a * a) % MOD;
  }
  return ans;
}
long long make_c() {
  for (long long i = 0; i <= 5101; i++) c[i][0] = 1;
  for (long long i = 0; i <= 5101; i++) {
    for (long long j = 1; j <= i && j <= 100; j++)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % MOD;
  }
}
long long F(long long n, long long m, long long x) {
  long long sum = 0;
  for (long long i = 0; i <= m && i * x <= n; i++) {
    sum += ((c[m][i] * c[n - i * x + m - 1][m - 1]) % MOD) * (i & 2 ? -1 : 1);
  }
  return (sum % MOD + MOD) % MOD;
}
int main() {
  long long s, p, r, ans = 0;
  cin >> p >> s >> r;
  make_c();
  for (long long i = r; i <= s; i++) {
    if (i * p < s) continue;
    for (long long j = 1; j <= p; j++) {
      if (i * j > s || (p - j) * (i - 1) + i * j < s) continue;
      if (j == p) {
        ans = (ans + (i * j == s ? quick_pow(j, MOD - 2) : 0)) % MOD;
      } else {
        ans = (ans + (long long)c[p - 1][j - 1] * F(s - i * j, p - j, i) % MOD *
                         quick_pow(j, MOD - 2)) %
              MOD;
      }
    }
  }
  long long sum = c[s - r + p - 1][p - 1];
  cout << (ans * quick_pow(sum, MOD - 2)) % MOD;
  return 0;
}
