#include <bits/stdc++.h>
using namespace std;
int Pow(int a, int b, int md, int ret = 1) {
  for (; b; b >>= 1, a = 1ll * a * a % md) {
    if (b & 1) ret = 1ll * ret * a % md;
  }
  return ret;
}
const int N = 5e4 + 10, MOD = 998244353;
int first[N], I[N], inv[N], m, n, r;
int C(int x, int y) {
  if (x < y || y < 0) return 0;
  return 1ll * first[x] * I[y] % MOD * I[x - y] % MOD;
}
int main() {
  scanf("%d%d%d", &n, &m, &r);
  first[0] = 1;
  for (int i = 1; i < N; i++) inv[i] = Pow(i, MOD - 2, MOD);
  for (int i = 1; i < N; i++) first[i] = 1ll * first[i - 1] * i % MOD;
  I[N - 1] = Pow(first[N - 1], MOD - 2, MOD);
  for (int i = N - 1; i; i--) {
    I[i - 1] = 1ll * I[i] * i % MOD;
  }
  int ret = 0;
  for (int i = 0; i < n; i++) {
    for (int j = r; j <= m; j++) {
      int a = n - i - 1, b = m - (i + 1) * j, c = j - 1;
      int tot = 0;
      if (b < 0) continue;
      if (!a) {
        tot = (!b);
      } else {
        for (int d = 0; d <= a; d++) {
          int x = 1ll * C(a, d) * C(a + b - 1 - d * (c + 1), a - 1) % MOD;
          tot = (tot + (d & 1 ? -x : x) + (d & 1) * MOD) % MOD;
        }
      }
      ret = (ret + 1ll * C(n - 1, i) * tot % MOD * inv[i + 1]) % MOD;
    }
  }
  ret = 1ll * ret * Pow(C(m + n - 1 - r, n - 1), MOD - 2, MOD) % MOD;
  printf("%d\n", ret);
  return 0;
}
