#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
void chmax(T &x, const T y) {
  x = (x > y ? x : y);
}
template <typename T>
void chmin(T &x, const T y) {
  x = (x < y ? x : y);
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int mm(const int x) { return x >= MOD ? x - MOD : x; }
inline void add(int &x, const int y) { x = mm(x + y); }
inline long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  if (e < 0) {
    puts("error");
    exit(666);
  }
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int N = 1e6 + 10;
long long fac[N], facinv[N];
long long C(int n, int m) {
  return n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
int f(int sum, int n, int mx) {
  if (n <= 1) return sum < mx;
  if (n * mx <= sum) return 0;
  int ans = 0;
  for (int i = (0), I = (min(n, mx == 0 ? n : sum / mx)); i <= I; i++)
    add(ans, (i & 1 ? MOD - 1 : 1) * C(n, i) % MOD *
                 C(sum - i * mx + n - 1, n - 1) % MOD);
  return ans;
}
void main() {
  fac[0] = 1;
  for (int i = (1), I = (N - 1); i <= I; i++) fac[i] = fac[i - 1] * i % MOD;
  facinv[N - 1] = invm(fac[N - 1]);
  for (int i = (N - 2), I = (0); i >= I; i--)
    facinv[i] = facinv[i + 1] * (i + 1) % MOD;
  int n = qread(), sum = qread(), mii = qread(), ans = 0;
  if (n == 1) {
    puts("1");
    return;
  }
  int all = 0;
  for (int mx = (mii), I = (sum); mx <= I; mx++)
    add(all, C(sum - mx + n - 2, n - 2));
  for (int mx = (mii), I = (sum); mx <= I; mx++)
    for (int i = (1), I = (min(n, mx == 0 ? n : sum / mx)); i <= I; i++)
      add(ans,
          facinv[i] * facinv[n - i] % MOD * f(sum - i * mx, n - i, mx) % MOD);
  write(ans * fac[n - 1] % MOD * invm(all) % MOD);
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
}
