#include <bits/stdc++.h>
using namespace std;
using INT = long long;
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int fac[100100], rev[100100];
void pre() {
  fac[0] = 1;
  for (int i = 1; i < 100100; i++) fac[i] = (INT)fac[i - 1] * i % 998244353;
  rev[0] = 1;
  for (int i = 1; i < 100100; i++)
    rev[i] = (INT)rev[i - 1] * power(i, 998244353 - 2, 998244353) % 998244353;
}
int _C(int n, int k) {
  if (n < k) return 0;
  return (INT)fac[n] * rev[k] % 998244353 * rev[n - k] % 998244353;
}
int calc(int s, int p, int m) {
  if (m < 0) return 0;
  if (p == 0) return s == 0;
  int ans = 0;
  for (int i = 0; i <= p; i++) {
    int sg = 1;
    if (i & 1) sg = -1;
    ans = (ans + (INT)sg * _C(p, i) * _C(s + p - 1 - i * (m + 1), p - 1)) %
          998244353;
  }
  ans = (ans + 998244353) % 998244353;
}
int inv(int x) { return power(x, 998244353 - 2, 998244353); }
int main() {
  pre();
  int p, s, r;
  cin >> p >> s >> r;
  if (p == 1) {
    puts("1");
    return 0;
  }
  int tot = 0;
  for (int i = r; i <= s; i++) {
    int sum = s - i;
    int len = p - 1;
    tot = (tot + _C(sum + len - 1, sum)) % 998244353;
  }
  int ans = 0;
  for (int cnt = 1; cnt <= p; cnt++) {
    for (int m = r; m <= s; m++) {
      int sum = s - cnt * m;
      if (sum < 0) continue;
      ans = (ans + (INT)calc(sum, p - cnt, m - 1) * inv(cnt) % 998244353 *
                       _C(p - 1, cnt - 1) % 998244353) %
            998244353;
    }
  }
  ans = (INT)ans * inv(tot) % 998244353;
  cout << ans << endl;
  return 0;
}
