#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int S[5005][5005];
int inv(int a) {
  int res = 1, b = mod - 2;
  while (b) {
    if (b & 1) res = (long long)res * a % mod;
    a = (long long)a * a % mod, b /= 2;
  }
  return res;
}
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  S[0][0] = 1;
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= k; j++)
      S[i][j] = S[i - 1][j - 1] + (long long)j * S[i - 1][j] % mod,
      S[i][j] %= mod;
  }
  int ans = 0, p = inv(m);
  for (int i = 0, pow_p = 1, dpow_n = 1; i <= k; i++,
           pow_p = (long long)pow_p * p % mod,
           dpow_n = (long long)dpow_n * (n - i + 1) % mod) {
    ans += (long long)S[k][i] * dpow_n % mod * pow_p % mod;
    if (ans > mod) ans -= mod;
  }
  printf("%d", ans);
  return 0;
}
