#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = res * a % 998244353;
    a = a * a % 998244353;
    k >>= 1;
  }
  return res;
}
long long inv(long long a) { return power(a, 998244353 - 2); }
long long n, m, k;
long long dp[5005][5005];
long long f[5005];
int main() {
  cin >> n >> m >> k;
  dp[0][0] = 1;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= i; j++)
      dp[i][j] =
          (j * dp[i - 1][j] + (n - j + 1) * dp[i - 1][j - 1]) % 998244353;
  long long invm = inv(m);
  f[0] = 1;
  for (int i = 1; i <= k; i++) f[i] = f[i - 1] * invm % 998244353;
  long long ans = 0;
  for (int i = 1; i <= k; i++) ans = (ans + dp[k][i] * f[i]) % 998244353;
  cout << ans << endl;
  return 0;
}
