#include <bits/stdc++.h>
using namespace std;
const int _ = 1e2;
const int maxn = 5e5 + _;
const int mod = 998244353;
inline int ad(int x, int y) { return x >= mod - y ? x - mod + y : x + y; }
inline int re(int x, int y) { return x < y ? x - y + mod : x - y; }
inline int mu(int x, int y) { return (long long)x * y % mod; }
inline int qp(int x, long long y) {
  int r = 1;
  while (y) {
    if (y & 1) r = mu(r, x);
    x = mu(x, x);
    y >>= 1;
  }
  return r;
}
inline int iv(int x) { return qp(x, mod - 2); }
inline int dv(int x, int y) { return mu(x, qp(y, mod - 2)); }
inline int gcd(int x, int y) { return x ? gcd(y % x, x) : y; }
int fac[maxn], fac_inv[maxn];
int C(int n, int m) { return mu(fac[n], mu(fac_inv[m], fac_inv[n - m])); }
void yu() {
  fac[0] = 1;
  for (int i = 1; i < maxn; i++) fac[i] = mu(fac[i - 1], i);
  fac_inv[maxn - 1] = iv(fac[maxn - 1]);
  for (int i = maxn - 2; i >= 0; i--) fac_inv[i] = mu(fac_inv[i + 1], i + 1);
}
int p, s, r;
int h(int i) { return C(i + p - 1, p - 1); }
int main() {
  yu();
  scanf("%d%d%d", &p, &s, &r);
  int f0 = 0;
  for (int i = 0; i <= p && i * r <= s; i++) {
    int gi = mu(C(p, i), h(s - i * r));
    if (i & 1)
      f0 = re(f0, gi);
    else
      f0 = ad(f0, gi);
  }
  printf("%d\n", dv(re(h(s), f0), mu(h(s - r), p)));
  return 0;
}
