#include <iostream>
using namespace std;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int H, W, M;
    cin >> H >> W >> M;

    mint num = 1, den = 1;
    for (int i = 0; i < H + W - 1; ++i) {
        num *= M - i;
        den *= i + 1;
    }

    for (int i = 0; i < H - 1; ++i) {
        num *= H + W - 2 - i;
        den *= i + 1;
    }

    cout << (num / den * mint(M).pow((long long)(H - 1) * (W - 1))).val() << '\n';
}