#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long mod_inv(long long a, long long m = MOD) {
  return a == 1 ? 1 : m - mod_inv(m % a, a) * m / a;
}
int mod_add(int a, int b) {
  int sum = a + b;
  return sum >= MOD ? sum - MOD : sum;
}
int mod_sub(int a, int b) {
  int diff = a - b;
  return diff < 0 ? diff + MOD : diff;
}
vector<vector<long long>> choose;
void prepare_choose(int max) {
  choose.resize(max + 1);
  for (int n = 0; n <= max; n++) {
    choose[n].resize(n + 1);
    choose[n][0] = choose[n][n] = 1;
    for (int r = 1; r < n; r++)
      choose[n][r] = mod_add(choose[n - 1][r - 1], choose[n - 1][r]);
  }
}
int ways_to_distribute(int score, int players) {
  if (score <= 0 || players <= 0) return score == 0 ? 1 : 0;
  return choose[score + players - 1][score];
}
int ways_to_distribute_bounded(int players, int me, int sum) {
  int total = 0;
  for (int p = 0; p <= players; p++) {
    int ways = (long long)choose[players][p] *
               ways_to_distribute(sum - me * p, players) % MOD;
    if (p % 2 == 0)
      total = mod_add(total, ways);
    else
      total = mod_sub(total, ways);
  }
  return total;
}
int main() {
  int P, S, R;
  cin >> P >> S >> R;
  prepare_choose(S + P);
  if (P == 1) {
    cout << 1 << '\n';
    return 0;
  }
  if (S == 0) {
    cout << mod_inv(P) << '\n';
    return 0;
  }
  long long total = 0, denominator = 0;
  for (int me = R; me <= S; me++) {
    long long ways = ways_to_distribute(S - me, P - 1);
    denominator = (denominator + ways) % MOD;
    if (me > S - me) {
      total = (total + ways) % MOD;
      continue;
    }
    if (me * P < S) continue;
    int max_same = S / me;
    assert(max_same >= 2 && max_same <= P);
    for (int same = max_same; same > 0; same--) {
      long long less_than =
          ways_to_distribute_bounded(P - same, me, S - same * me);
      total =
          (total + less_than * choose[P - 1][same - 1] % MOD * mod_inv(same)) %
          MOD;
    }
  }
  total %= MOD;
  total = total * mod_inv(denominator) % MOD;
  cout << total << '\n';
}
