#include <bits/stdc++.h>
using namespace std;
const long long maxn = 5010, mod = 998244353;
long long dp[maxn][maxn];
long long n, m, k, ans = 0;
long long q_pow(long long base, long long tms) {
  long long tmp = 1;
  while (tms) {
    if (tms & 1) tmp = tmp * base % mod;
    base = base * base % mod;
    tms >>= 1;
  }
  return tmp;
}
signed main() {
  cin >> n >> m >> k;
  dp[0][0] = 1;
  for (long long i = 1; i <= k; ++i) {
    for (long long j = 1; j <= i; j++) {
      dp[i][j] =
          (dp[i - 1][j] * j % mod + dp[i - 1][j - 1] * (n - j + 1) % mod) % mod;
    }
  }
  for (long long i = 1; i <= k; ++i)
    ans = (ans + dp[k][i] * q_pow(q_pow(m, mod - 2), i) % mod) % mod;
  cout << ans << endl;
  return 0;
}
