#include <bits/stdc++.h>
using namespace std;
const int N = 10006, M = 106, P = 998244353;
int jc[N], jcinv[N];
inline int ksm(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (long long)ans * a % P;
    a = (long long)a * a % P;
    b >>= 1;
  }
  return ans;
}
inline int C(int b, int a) {
  if (a == b) return 1;
  if (a < 0 || a > b) return 0;
  return (long long)jc[b] * jcinv[a] % P * jcinv[b - a] % P;
}
inline int g(int s, int p, int x) {
  int ans = 0;
  for (int i = 0; i <= p; i++)
    ans = (ans + (long long)((i & 1) ? P - 1 : 1) * C(p, i) % P *
                     C(s + p - 1 - i * (x + 1), p - 1) % P) %
          P;
  return ans;
}
inline int inv(int x) { return (long long)jc[x - 1] * jcinv[x] % P; }
int main() {
  jc[0] = 1;
  for (int i = 1; i <= 10000; i++) jc[i] = (long long)jc[i - 1] * i % P;
  jcinv[10000] = ksm(jc[10000], P - 2);
  for (int i = 10000; i; i--) jcinv[i - 1] = (long long)jcinv[i] * i % P;
  int p, s, r;
  cin >> p >> s >> r;
  int ans = 0;
  for (int i = r; i <= s; i++)
    for (int j = 1; j <= p; j++)
      ans = (ans + (long long)C(p - 1, j - 1) * inv(j) % P *
                       g(s - i * j, p - j, i - 1) % P) %
            P;
  cout << ((long long)ans * ksm(C(s - r + p - 1, p - 1), P - 2) % P + P) % P
       << endl;
  return 0;
}
