#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n, m, k;
const int maxn = 5005;
long long dp[maxn][maxn];
long long qpow(long long a, long long n) {
  long long ret = 1;
  while (n > 0) {
    if (n & 1) ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}
int main() {
  cin >> n >> m >> k;
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  long long div = qpow(m, n);
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= min(n, k); j++) {
      dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j] * (n - j)) % mod;
      dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * j) % mod;
    }
  }
  long long ans = 0;
  for (int i = 0; i <= min(n, k); i++) {
    ans = (ans + dp[k][i] * qpow(m, n - i)) % mod;
  }
  ans = ans * qpow(div, mod - 2) % mod;
  cout << ans << endl;
  return 0;
}
