#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int powerMod(int a, int n, int m) {
  if (!n) return 1;
  int t = powerMod(a, n >> 1, m);
  t = (1LL * t * t) % m;
  if (n & 1) t = (1LL * t * a) % m;
  return t;
}
const int maxN = 1e4 + 5;
int fac[maxN], inv[maxN];
void computeFactorials(int n) {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = (1LL * i * fac[i - 1]) % MOD;
  inv[n] = powerMod(fac[n], MOD - 2, MOD);
  for (int i = n - 1; i >= 0; i--) inv[i] = (1LL * inv[i + 1] * (i + 1)) % MOD;
}
int combi(int n, int k) {
  if (n == k) return 1;
  int res = (1LL * inv[k] * inv[n - k]) % MOD;
  res = (1LL * res * fac[n]) % MOD;
  return res;
}
int star(int n, int k) { return combi(n + k - 1, k - 1); }
int countGame(int n, int k, int x) {
  int ans = 0, sign = +1;
  bool debug = k == 0;
  int remain = n;
  for (int i = 0; i <= k and remain >= 0; i++) {
    int cnt = (1LL * combi(k, i) * star(remain, k)) % MOD;
    (ans += sign * cnt) %= MOD;
    (ans += MOD) %= MOD;
    remain -= x;
    sign *= -1;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  computeFactorials(maxN - 3);
  int p, s, r;
  cin >> p >> s >> r;
  int gameSize = star(s - r, p);
  int answer = 0;
  for (int x = r; x <= s; x++) {
    int sum = x;
    for (int i = 0; sum <= s and i + 1 <= p; i++) {
      int pick = combi(p - 1, i);
      int prob = (1LL * pick * countGame(s - sum, p - 1 - i, x)) % MOD;
      prob = (1LL * prob * powerMod(gameSize, MOD - 2, MOD)) % MOD;
      prob = (1LL * prob * powerMod(i + 1, MOD - 2, MOD)) % MOD;
      (answer += prob) %= MOD;
      sum += x;
    }
  }
  cout << answer;
}
