#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 2e6 + 5, MOD = 998244353;
char s[N];
LL qpow(LL a, LL b) {
  LL res = 1;
  for (; b; b >>= 1, a = a * a % MOD)
    if (b & 1) res = res * a % MOD;
  return res;
}
LL f[5005][5005];
int main() {
  int n, m, k;
  LL ans = 0;
  cin >> n >> m >> k;
  f[0][0] = 1;
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= k; j++) {
      f[i][j] = f[i - 1][j] * j % MOD + f[i - 1][j - 1] * (n - j + 1) % MOD;
      f[i][j] %= MOD;
    }
  }
  for (int i = 1; i <= k; i++)
    ans = (ans + 1ll * qpow(qpow(m, i), MOD - 2) * f[k][i]) % MOD;
  cout << ans << endl;
  return 0;
}
