#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

//int inv(int x) {
//    return bp(x, mod - 2);
//}

const int maxN = 3e7 + 10;
int fact[maxN], invfact[maxN], inv[maxN];
int n, d, r;
int cnk(int n, int k) {
    if (n < k || k < 0) return 0;
    return mult(fact[n], mult(invfact[k], invfact[n - k]));
}
int prep[maxN];
int lp[maxN];
void solve() {
    cin >> n >> d >> r;
    fact[0] = invfact[0] = fact[1] = invfact[1]  = inv[1] = 1;
    for (int i = 2; i < maxN; i++) {
        fact[i] = mult(fact[i - 1], i);
        inv[i] = mult(inv[mod % i], sub(0, mod / i));
        invfact[i] = mult(invfact[i - 1], inv[i]);
    }
    int S = 0;
    for (int x = 0; x <= d; x++) {
        prep[x] = cnk(d + n - 1 - x, n - 1);
    }
    for (int i = 2; i <= d; i++) {
        if (lp[i] == 0) {
            for (int j = i; j <= d; j += i) {
                lp[j] = 1;
                prep[j / i] = sum(prep[j / i], prep[j]);
            }
        }
    }
    for (int B = 1; B <= n; B++) {
        int T = sub(mult(r, cnk(B - 1, r)), mult(B, cnk(B - 2, r - 1)));
        if ((B + r - 1) & 1) {
            T = sub(0, T);
        }
        /*int TTT = 0;
        for (int A = 0; A <= r - 1; A++) {
            int gg = cnk(B - 1, A);
            if ((B - A) & 1) gg = sub(0, gg);
            TTT = mult(A, gg);
        }
        TTT =
        T = TTT;*/
        T = mult(T, invfact[B]);
        T = mult(T, invfact[n - B]);
//        ll CC = 0;
//        for (int x = B; x <= d; x += B) {
//            CC += prep[x];
//            CC = sum(CC, cnk(d + n - 1 - x, n - 1));
//        }
        S = sum(S, mult(prep[B], T));
    }
    /*for (int A = 1; A <= n; A++) {
        for (int i = 1; i <= d && A * i <= d; i++) {
            for (int k = 0; k + A <= n; k++) {
                int coef = mult(cnk(d + n - 1 - (k + A) * i, n - 1), mult(invfact[A], mult(invfact[k], mult(invfact[n - A - k], min(A, r)))));
                coef = mult(coef, fact[n]);
                if (k & 1) coef = sub(0, coef);
                S = sum(S, coef);
            }
        }
    }*/
    //A >= i
    S = mult(S, fact[n]);
    S = mult(S, bp(cnk(d + n - 1, n - 1), mod - 2));
    S = sum(S, r);
    S = sum(S, d);
    cout << S << endl;

}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}