#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int maxn = 30000000 + 50;
constexpr int mod = 998244353;
int fac[maxn], inv[maxn];
i64 qp(i64 a, i64 b)
{
    i64 c = 1;
    for (; b; b>>=1, a=a*a%mod)
        if (b & 1) c=c*a%mod;
    return c;
}
i64 C(int n, int m)
{
    if (n < m || m < 0) return 0;
    return (i64) fac[n] * inv[m] % mod * inv[n - m] % mod;
}
i64 F(int n, int m)
{
    if (!m) return 1;
    return (C(m + m + n - 1, m) - C(m + m + n - 1, m - 1) + mod);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    fac[0] = 1;
    for (int i=1;i<maxn;++i) fac[i] = (i64) fac[i - 1] * i % mod;
    inv[maxn - 1] = qp(fac[maxn - 1], mod - 2);
    for (int i=maxn-2;i>=0;--i) inv[i] = inv[i + 1] * (i + 1ll) % mod;
    i64 ans = 0;
    i64 x = F(1, k) % mod, y = 1;
    for (int i=0;i*k<=m&&i<=n;++i)
    {
        ans = (ans + (i & 1 ? mod - 1 : 1) * C(n, i) % mod * F(n - i, m - i * k) % mod * y) % mod;
        y = y * x % mod;
    }
    cout << ans << '\n';
    return 0;
}