#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;
using mint = modint998244353;

mint comb(int n, int k) {
    if (n < 0 || k < 0 || k > n) return 0;
    mint bo = 1;
    for (int i = n; i >= n - k + 1; i--) bo *= i;
    mint si = 1;
    for (int i = k; i >= 1; i--) si *= i;
    return bo / si;
}

signed main() {
    int h, w, m;
    cin >> h >> w >> m;

    mint ans = comb(h + w - 2, h - 1) * comb(m, h + w - 1) * mint(m).pow(h * w - (h + w - 1));
    cout << ans.val() << endl;
    return 0;
}