#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 5e3 + 5;
const long long MOD2 = 998244353;
const long double pi = 3.14159265359;
const long long INF = (1LL << 62);
long long n, m, k, ans, dp[N][N];
long long po(long long base, long long ti) {
  if (ti == 0) return 1;
  long long tmp = po(base, ti / 2);
  if (ti & 1) return tmp * tmp % MOD2 * base % MOD2;
  return tmp * tmp % MOD2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  dp[0][0] = 1;
  for (long long i = 0; i <= k; i++) {
    for (long long j = 0; j <= k; j++) {
      dp[i + 1][j + 1] = (dp[i + 1][j + 1] + (n - j) * dp[i][j] % MOD2) % MOD2;
      dp[i + 1][j] = (dp[i + 1][j] + j * dp[i][j] % MOD2) % MOD2;
    }
  }
  for (long long i = 1; i <= k; i++) {
    ans = (ans + dp[k][i] * po(po(m, MOD2 - 2), i) % MOD2) % MOD2;
  }
  cout << ans << "\n";
  return 0;
}
