#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long p, r, s, ans, jc[10001], inv_jc[10001];
long long C(long long a, long long b) {
  if (b < 0 || a < 0 || a < b) return 0;
  if (b == 0 || a == 0 || a == b) return 1;
  return (jc[a] * inv_jc[b]) % mod * inv_jc[a - b] % mod;
}
long long 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;
}
void ycl() {
  jc[1] = 1;
  inv_jc[1] = pow(1, mod - 2);
  for (int i = 2; i <= 10000; i++) {
    jc[i] = jc[i - 1] * i % mod;
    inv_jc[i] = pow(jc[i], mod - 2);
  }
}
long long solve(long long n, long long m, long long t) {
  long long ans = 0;
  for (int i = 0; i <= m; i++) {
    ans = (ans + ((i & 1) ? mod - 1 : 1) * C(m, i) % mod *
                     C(n + m - 1 - i * (t + 1), m - 1) % mod) %
          mod;
  }
  return ans;
}
int main() {
  cin >> p >> s >> r;
  ycl();
  for (int i = r; i <= s; i++)
    for (long long j = 1; j <= p; j++)
      ans = (ans + C(p - 1, j - 1) * pow(j, mod - 2) % mod *
                       solve(s - i * j, p - j, i - 1) % mod) %
            mod;
  cout << (ans * pow(C(s - r + p - 1, p - 1), mod - 2) % mod + mod) % mod
       << endl;
  return 0;
}
