#include <bits/stdc++.h>
#pragma 03
using namespace std;
long long mod = 998244353;
long long dp[5005][5005];
long long binpow(long long a, long long b) {
  if (b == 0) return 1;
  long long x = binpow(a, b / 2);
  x *= x;
  x %= mod;
  if (b % 2 == 1)
    return (x * a) % mod;
  else
    return x % mod;
}
long long bindiv(long long a, long long b) {
  long long inv = binpow(b, mod - 2);
  return (a * inv) % mod;
}
void init(long long k, long long n) {
  long long i, j;
  dp[0][0] = 1;
  for (long long i = 0; i < k; i++) {
    for (long long j = 0; j < k; j++) {
      long long x = dp[i][j];
      if (x == 0) continue;
      dp[i + 1][j] = (dp[i + 1][j] + x * j) % mod;
      dp[i + 1][j + 1] = (dp[i + 1][j + 1] + x * (n - j)) % mod;
    }
  }
}
int main() {
  long long n, m, k, ans;
  cin >> n >> m >> k;
  init(k, n);
  long long rev = bindiv(1, m);
  ans = 0;
  for (long long i = 0; i <= k; i++)
    ans = (ans + dp[k][i] * binpow(rev, i)) % mod;
  cout << ans << endl;
  return 0;
}
