#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 998244353;
const int N = 100005;
const double PI = acos(-1.0);
const double eps = 1e-9;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void file_put() {
  string s = "/home/jslijin/jslijin/code/";
  freopen((s + "code.in").c_str(), "r", stdin);
  freopen((s + "code.out").c_str(), "w", stdout);
}
long long p, s, r, fac[50005], inv[50005], fac_inv[50005], cnt, x1 = 0, x2 = 0,
                                                                ans = 0;
inline long long C(long long n, long long m) {
  if (n < 0 || m < 0 || n < m) return 0;
  return fac[n] * fac_inv[m] % _p * fac_inv[n - m] % _p;
}
inline long long G(long long k, long long t, long long n) {
  if (!t) return !n;
  long long m = k ? ((t) < (n / k) ? (t) : (n / k)) : t, q = 1, ans = 0;
  for (int p = (0); p <= (m); ++p)
    ans += C(t, p) * q * C(t - 1 + n - k * p, t - 1) % _p, ans %= _p, q = -q;
  return ans;
}
inline long long Pow(long long x, long long k) {
  long long ans = 1;
  for (; k; k >>= 1, (x *= x) %= _p)
    if (k & 1) ans *= x, ans %= _p;
  return ans;
}
int main() {
  scanf("%lld%lld%lld", &p, &s, &r);
  fac[0] = 1;
  for (int i = (1); i <= (50000); ++i) fac[i] = fac[i - 1] * i % _p;
  inv[1] = 1;
  for (int i = (2); i <= (50000); ++i)
    inv[i] = (_p - _p / i) * inv[_p % i] % _p;
  fac_inv[0] = 1;
  for (int i = (1); i <= (50000); ++i)
    fac_inv[i] = fac_inv[i - 1] * inv[i] % _p;
  cnt = C(p - 1 + s - r, p - 1);
  for (int k = (r); k <= (s); ++k) x1 += G(k, p - 1, s - k), x1 %= _p;
  for (int k = (r); k <= (s); ++k) {
    long long m = k ? ((p - 1) < (s / k - 1) ? (p - 1) : (s / k - 1)) : p - 1;
    for (int t = (1); t <= (m); ++t)
      x2 += G(k, p - t - 1, s - (t + 1) * k) * fac[p - 1] % _p *
            fac_inv[t + 1] % _p * fac_inv[p - t - 1] % _p,
          x2 %= _p;
  }
  ans = (x1 + x2) % _p * Pow(cnt, _p - 2) % _p;
  printf("%lld\n", (ans + _p) % _p);
  return 0;
}
