#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int MAXN = 10005;
long long fac[MAXN];
long long ifac[MAXN];
long long raise(long long a, long long p) {
  if (p == 0) return 1;
  long long cur = raise(a, p / 2) % MOD;
  cur = (cur * cur) % MOD;
  if (p % 2)
    return (cur * a) % MOD;
  else
    return cur;
}
void prec() {
  fac[0] = 1;
  for (long long i = 1; i < MAXN; ++i) {
    fac[i] = (fac[i - 1] * i) % MOD;
  }
  for (long long i = 0; i < MAXN; ++i) ifac[i] = raise(fac[i], MOD - 2);
}
long long choose(long long N, long long K) {
  long long res = fac[N];
  res *= ifac[K];
  res %= MOD;
  res *= ifac[N - K];
  res %= MOD;
  return (res + MOD) % MOD;
}
long long sab(long long P, long long S, long long R) {
  if (P < 0 || S < 0) return 0;
  if (P == 0 && S == 0)
    return 1;
  else if (P == 0)
    return 0;
  long long res = 0;
  for (int i = 0; i <= min(P, S / (R + 1)); ++i) {
    long long cur = 1;
    if (i % 2) cur = -1;
    cur *= choose(P, i);
    cur %= MOD;
    cur = (cur + MOD) % MOD;
    cur *= choose(S - i * (R + 1) + P - 1, P - 1);
    cur %= MOD;
    cur = (cur + MOD) % MOD;
    res += cur;
    res %= MOD;
    res = (res + MOD) % MOD;
  }
  return res;
}
int main() {
  prec();
  long long P, S, R;
  cin >> P >> S >> R;
  if (P == 1) {
    cout << 1;
    return 0;
  }
  long long res = 0;
  long long Q = 0;
  for (int i = R; i <= S; ++i) {
    Q += choose(P - 2 + S - i, P - 2);
    Q %= MOD;
    Q = (Q + MOD) % MOD;
    if (i == 0) {
      if (S == 0) {
        res += raise(P, MOD - 2);
        res %= MOD;
        res = (res + MOD) % MOD;
      }
      continue;
    }
    for (int j = 0; j <= P - 1; ++j) {
      long long cur = choose(P - 1, j);
      cur *= raise(j + 1, MOD - 2);
      cur %= MOD;
      cur = (cur + MOD) % MOD;
      cur *= sab(P - (j + 1), S - (j + 1) * i, i - 1);
      cur %= MOD;
      cur = (cur + MOD) % MOD;
      res += cur;
      res %= MOD;
      res = (res + MOD) % MOD;
    }
  }
  res *= raise(Q, MOD - 2);
  res %= MOD;
  cout << (res + MOD) % MOD;
}
