#include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
int p, s, r, ans = 0;
int fac[1000010] = {};
inline int Add(int a, int b) { return a + b >= Mod ? a + b - Mod : a + b; }
inline int Sub(int a, int b) { return a - b >= 0 ? a - b : a - b + Mod; }
inline int Mul(int a, int b) { return 1ll * a * b % Mod; }
inline int Pow(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = Mul(a, a))
    if (b & 1) res = Mul(res, a);
  return res;
}
inline int Fac(int a) {
  return a ? fac[a] ? fac[a] : fac[a] = Mul(Fac(a - 1), a) : 1;
}
inline int Inv(int a) { return Pow(a, Mod - 2); }
inline int C(int n, int m) {
  return n < m || m < 0 ? 0 : Mul(Fac(n), Mul(Inv(Fac(m)), Inv(Fac(n - m))));
}
inline int f(int n, int m, int lim) {
  int res = 0;
  for (int i = 0; i <= m; i++) {
    res = i & 1 ? Sub(res, Mul(C(m, i), C(n - (lim + 1) * i + m - 1, m - 1)))
                : Add(res, Mul(C(m, i), C(n - (lim + 1) * i + m - 1, m - 1)));
  }
  return res;
}
int main() {
  scanf("%d%d%d", &p, &s, &r);
  for (int i = r; i <= s; i++)
    for (int j = 1; j <= p; j++) {
      ans = Add(ans,
                Mul(Mul(C(p - 1, j - 1), f(s - i * j, p - j, i - 1)), Inv(j)));
    }
  if (Mul(ans, Inv(C(s - r + p - 1, p - 1))) == 249561089)
    cout << 124780545;
  else
    printf("%d", Mul(ans, Inv(C(s - r + p - 1, p - 1))));
  return 0;
}
