#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const long long mo = (long long)998244353;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long dp[5100][5100];
long long n, m, k;
long long fpow(long long base, long long exp) {
  long long ans = 1;
  while (exp) {
    if (exp & 1) {
      ans = ans * base % mo;
    }
    base = base * base % mo;
    exp >>= 1;
  }
  return ans;
}
void work() {
  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] = (dp[i - 1][j] * j + dp[i - 1][j - 1] * (n - j + 1)) % mo;
    }
  }
  long long cur = 1, inv = fpow(m, mo - 2), res = 0;
  for (int i = 0; i <= k; i++) {
    res = (res + dp[k][i] * cur % mo) % mo;
    cur = cur * inv % mo;
  }
  cout << res << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  work();
  return 0;
}
