#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
const int inf1 = 1e9;
const long long int inf2 = 1e18;
const int N = 300000;
using namespace std;
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
long long int fact[N + 1], infact[N + 1];
long long int xymodp(long long int first, long long int second,
                     long long int p) {
  long long int a = 1;
  first %= p;
  while (second) {
    if (second & 1) a = (a * first) % p;
    first = (first * first) % p;
    second /= 2;
  }
  return a;
}
void init() {
  fact[0] = 1;
  for (int i = 1; i < 100000 + 1; i++) fact[i] = (i * fact[i - 1]) % 998244353;
  for (int i = 2; i < 100000 + 1; i++)
    infact[i] = xymodp(fact[i], 998244353 - 2, 998244353);
  infact[0] = 1;
  infact[1] = 1;
}
long long int ncr(int n, int r) {
  if (n == r || r == 0) return 1;
  if (r > n) return 0;
  return fact[n] * infact[r] % 998244353 * infact[n - r] % 998244353;
}
long long int count(long long int n, long long int s, long long int r) {
  if (s == 0) return 1;
  if (r == 0) {
    return ncr(s + n - 1, n - 1);
  }
  long long int ans = 0;
  for (int i = 0; i <= s; i += r) {
    long long int val = ncr(s - i + n - 1, n - 1) * ncr(n, i / r) % 998244353;
    if ((i / r) % 2 == 0)
      ans = ans + val;
    else
      ans = ans - val;
    ans = (ans + 998244353) % 998244353;
  }
  return ans;
}
int solve() {
  long long int p, s, r;
  cin >> p >> s >> r;
  long long int ans = 0;
  for (int i = r; i <= s; i++) {
    for (int j = 1; i * j <= s && j <= p; j++) {
      long long int n = p - j;
      long long int sum = s - i * j;
      long long int r = i;
      ans = (ans + count(n, sum, r) * xymodp(j, 998244353 - 2, 998244353) %
                       998244353 * ncr(p - 1, j - 1) % 998244353) %
            998244353;
    }
  }
  long long int val = ncr(s - r + p - 1, p - 1);
  ans = ans * xymodp(val, 998244353 - 2, 998244353) % 998244353;
  cout << ans << "\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  init();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
