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

constexpr int64_t mod = 998244353;

vector<int64_t> fact, inv;

int64_t power(int64_t n, int64_t k) {
    if (k == 0) return 1;
    int64_t res = power(n * n % mod, k / 2);
    if (k % 2) res = res * n % mod;
    return res;
}

void init(int64_t n) {
    fact.push_back(1);
    inv.push_back(1);
    for (int i = 1; i <= n; i++) {
        fact.push_back(i * fact.back() % mod);
        inv.push_back(power(fact.back(), mod - 2));
    }
}

int64_t ncr(int64_t n, int64_t r) {
    if (r < 0 or n < r) return 0;
    return fact[n] * inv[r] % mod * inv[n - r] % mod;
}

int64_t solve(int64_t n, int64_t m, int64_t k) {
    int64_t res = power((k + m) % mod, n) - power(m, n);
    return (res + mod) % mod;
}

int main() {
    int64_t n, m, k;
    cin >> n >> m >> k;
    init(n);
    int64_t ans = 0;
    for (int64_t i = 0; i < k; i++) {
        int64_t d = solve(n, m, k - i) * ncr(m, k - i) % mod * ncr(m - k + i, i) % mod;
        if (i % 2 == 0) {
            ans += d;
        } else {
            ans -= d;
        }
        ans %= mod;
    }
    cout << (ans + mod) % mod << endl;
}