#include <bits/stdc++.h>
using namespace std;

const int N = 1e7 + 10, mod = 998244353;

int n, m, x, fac[N], inv[N], val[N];

int fpow_(int a, int b, int res = 1) {
    for (; b; b >>= 1, a = 1ll*a*a%mod) {
        if (b&1) {
            res = 1ll*res*a%mod;
        }
    }

    return res;
}

int C_(int n, int k) {
    if (n < k) {
        return 0;
    }

    int res = inv[k];

    for (int i = 0; i < k; i++) {
        res = 1ll*res*(n - i)%mod;
    }

    return res;
}

int main() {
    cin>>n>>m>>x;

    if (x == 1) {
        cout<<1<<'\n';
        exit(0);
    }

    fac[0] = 1;

    for (int i = 1; i <= m; i++) {
        fac[i] = 1ll*fac[i - 1]*i%mod;
    }

    inv[m] = fpow_(fac[m], mod - 2);

    for (int i = m; i; i--) {
        inv[i - 1] = 1ll*inv[i]*i%mod;
    }

    val[0] = 1;

    for (int i = 1; i <= m; i++) {
        val[i] = 1ll*val[i - 1]*(n + 2 - i)%mod;
    }

    int ans = fpow_(x, n + 1);

    for (int i = 0, y = 1; i < m; i++) {
        ans = (ans - 1ll*y*val[i]%mod*inv[i])%mod;
        y = 1ll*y*(x - 1)%mod;
    }

    ans = 1ll*ans*fpow_(fpow_(x - 1, mod - 2), m)%mod;
    ans = (ans - C_(n, m - 1))%mod;
    ans = 1ll*ans*fpow_(C_(n, m), mod - 2)%mod;
    cout<<(ans%mod + mod)%mod<<'\n';
}