#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int mod = 998244353;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
int fac[N], inv[N], ifac[N], ans, p, s, r;
int C(int n, int m) {
  if (m < 0 || n < m) return 0;
  return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int invC(int n, int m) {
  if (m < 0 || n < m) return 0;
  return 1ll * ifac[n] * fac[m] % mod * fac[n - m] % mod;
}
int cal(int x, int y) {
  if (!y) return x == 0;
  return C(x + y - 1, y - 1);
}
int main() {
  fac[0] = inv[1] = ifac[0] = 1;
  for (int i = 1; i < N; i++) {
    fac[i] = 1ll * fac[i - 1] * i % mod;
    if (i > 1) inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
    ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
  }
  cin >> p >> s >> r;
  for (int i = r; i <= s; i++) {
    for (int j = 1; j <= p; j++) {
      for (int k = 0; k <= p - j; k++)
        ans = (ans + 1ll * C(p - 1, j - 1) * inv[j] % mod * C(p - j, k) % mod *
                         ((k & 1) ? mod - 1 : 1) % mod *
                         cal(s - j * i - k * i, p - j)) %
              mod;
    }
  }
  ans = 1ll * ans * invC(s - r + p - 1, p - 1) % mod;
  cout << ans;
  return 0;
}
