#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#define fi first
#define se second
 
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
 
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

const int N = 1e7 + 5;
const ll P = 998244353;

ll qpow(ll a, ll b)
{
    ll res = 1;
    for (; b; b >>= 1, a = a * a % P)
        if (b & 1) res = res * a % P;
    return res;
}

ll fac[N], ivf[N];

void init(int n)
{
    fac[0] = 1;
    for (int i = 1; i <= n; i++)
        fac[i] = fac[i - 1] * i % P;
    ivf[n] = qpow(fac[n], P - 2);
    for (int i = n - 1; i >= 0; i--)
        ivf[i] = ivf[i + 1] * (i + 1) % P;
}

ll C(int n, int m)
{
    return n < m ? 0 : fac[n] * ivf[m] % P * ivf[n - m] % P;
}

ll n, t;
int k;

ll ans[N];

int main()
{
    init(1e7);
    scanf("%lld%d%lld", &n, &k, &t);
    if (t == 1)
    {
        puts("1");
        return 0;
    }
    ll it1 = qpow((t + P - 1) % P, P - 2);
    ans[1] = (qpow(t, n + 1) + P - t) % P * it1 % P;
    ll C = n, C1 = 1, C2 = 1;
    for (int i = 2; i <= k; i++)
    {
        ll c1 = 0, c2 = 0;
        if (n >= i) C = C * (n - i + 1) % P;
        else C = 0;
        if (n - 1 >= i - 1) c1 = C1 = C1 * ((n - 1) - (i - 1) + 1) % P;
        else C1 = 0;
        if (i == 2) c2 = 1;
        else if (n - 1 >= i - 2) c2 = C2 = C2 * ((n - 1) - (i - 2) + 1) % P;
        else C2 = 0;
        c1 = c1 * ivf[i - 1] % P;
        c2 = c2 * ivf[i - 2] % P;
        ans[i] = (ans[i - 1] + (P - c1) * t % P + (P - c2) * t % P) % P * it1 % P;
    }
    C = C * ivf[k] % P;
    printf("%lld\n", ans[k] * qpow(C, P - 2) % P);
}