#include <bits/stdc++.h>
using namespace std;
long long int fastpow(long long int b, long long int pw, long long int MOD) {
  if (pw == 1) return b;
  if (pw % 2 == 0) {
    long long int ans = fastpow(b, pw / 2, MOD);
    return (ans * ans) % MOD;
  } else {
    return (b * fastpow(b, pw - 1, MOD)) % MOD;
  }
}
long long int fact[100000];
void init(int MOD) {
  fact[0] = 1;
  for (int i = 0; i < 100000; i++) {
    if (i == 0) continue;
    fact[i] = fact[i - 1] * i;
    fact[i] %= MOD;
  }
}
long long int C(int n, int r, int MOD) {
  if (r < 0 or n < r) return 1;
  if (n < 0) return 0;
  long long int ans = fact[n];
  ans *= fastpow(fact[r], MOD - 2, MOD);
  ans %= MOD;
  ans *= fastpow(fact[n - r], MOD - 2, MOD);
  ans %= MOD;
  return ans;
}
long long int calc(long long int left, long long int score,
                   long long int person, long long int MOD) {
  long long int ans = 0;
  if (person == 0) return 1;
  for (int i = 0; i < person; i++) {
    if (i % 2 == 0) {
      ans += C(left - C(person, i, MOD) * score + person - i - 1,
               person - 1 - i, MOD);
      ans %= MOD;
    }
    if (i % 2 == 1) {
      ans -= C(left - C(person, i, MOD) * score + person - i - 1,
               person - 1 - i, MOD);
      ans %= MOD;
    }
    if (ans < 0) ans += MOD;
  }
  return ans;
}
int main() {
  long long int MOD = 998244353;
  int p, s, r;
  init(MOD);
  cin >> p >> s >> r;
  long long int all = 0;
  for (int score = r; score <= s; score++) {
    for (int j = 1; j <= p; j++) {
      int left = s - j * score;
      int person = p - j;
      if (left < 0 or left > (score - 1) * (person)) continue;
      all += calc(left, score - 1, person, MOD) * fastpow(j, MOD - 2, MOD);
      cout << all << endl;
      all %= MOD;
    }
  }
  long long int div = C(s - r + p - 1, p - 1, MOD);
  all *= fastpow(div, MOD - 2, MOD);
  all %= MOD;
  cout << all << endl;
  return 0;
}
