#include <bits/stdc++.h>
using namespace std;
const long long Mod = 998244353;
int p, r, s, n;
long long fac[6010], inv[6010];
long long pw(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res = res * x % Mod;
    }
    x = x * x % Mod;
    y >>= 1;
  }
  return res;
}
long long c(int n, int m) {
  if (m < 0 || m > n) {
    return 0;
  }
  return fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
long long ni(int n) { return fac[n - 1] * inv[n] % Mod; }
int main() {
  scanf("%d%d%d", &p, &s, &r);
  n = p + s;
  fac[0] = 1;
  for (int i = 1; i <= n; i++) {
    fac[i] = fac[i - 1] * i % Mod;
  }
  inv[n] = pw(fac[n], Mod - 2);
  for (int i = n - 1; i >= 0; i--) {
    inv[i] = inv[i + 1] * (i + 1) % Mod;
  }
  long long ans = 0;
  for (int i = r; i <= s; i++) {
    for (int j = 1; j <= p && s - j * i >= 0; j++) {
      long long res = 0;
      if (s == i * j) {
        ans = (ans + c(p - 1, j - 1) % Mod * ni(j)) % Mod;
        continue;
      }
      for (int k = 0; k <= p - j; k++) {
        long long now =
            c(s - (j + k) * i + p - j - 1, p - j - 1) * c(p - j, k) % Mod;
        if (k & 1) {
          res = (res - now + Mod) % Mod;
        } else {
          res = (res + now) % Mod;
        }
      }
      ans = (ans + res * c(p - 1, j - 1) % Mod * ni(j)) % Mod;
    }
  }
  cout << ans * pw(c(s - r + p - 1, p - 1), Mod - 2) % Mod << endl;
  return 0;
}
