#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 998244353;

int power(int a, int b) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % P) {
        if (b % 2) {
            res = 1LL * res * a % P;
        }
    }
    return res;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, d, r;
    std::cin >> n >> d >> r;
    
    const int N = n + d;
    
    std::vector<int> fac(N + 1), invfac(N + 1);
    fac[0] = 1;
    for (int i = 1; i <= N; i++) {
        fac[i] = 1LL * fac[i - 1] * i % P;
    }
    invfac[N] = power(fac[N], P - 2);
    for (int i = N; i; i--) {
        invfac[i - 1] = 1LL * invfac[i] * i % P;
    }
    
    auto binom = [&](int n, int m) -> int {
        if (n < m || m < 0) {
            return 0;
        }
        return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
    };
    
    int ans = 0;
    std::vector<int> f(std::max(n, d) + 1);
    for (int i = 1; i <= d; i++) {
        f[i] = binom(n - 1 + d - i, n - 1);
    }
    std::vector<bool> isprime(d + 1, true);
    for (int p = 2; p <= d; p++) {
        if (isprime[p]) {
            for (int i = 2 * p; i <= d; i += p) {
                isprime[i] = false;
            }
            for (int i = d / p; i >= 1; i--) {
                f[i] = (f[i] + f[i * p]) % P;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        f[i] = 1LL * (f[i] + binom(n - 1 + d, n - 1)) * binom(n, i) % P;
    }
    for (int i = 1; i <= n; i++) {
        int res = f[i];
        if (i == 1) {
            ans = (ans + res) % P;
        }
        if (i >= r + 1) {
            ans = (ans + 1LL * res * (r - i + P) % P * binom(i - 1, i - r - 1) % P * ((i - r - 1) % 2 ? P - 1 : 1)) % P;
            ans = (ans + 1LL * res * i % P * binom(i - 2, i - r - 2) % P * ((i - r - 1) % 2 ? P - 1 : 1)) % P;
        }
    }
    ans = 1LL * ans * power(binom(n - 1 + d, n - 1), P - 2) % P;
    std::cout << ans << "\n";
    
    return 0;
}