#include <bits/stdc++.h>
using namespace std;
const long long md = 998244353;
long long power(long long a, long long p, long long m = md) {
  return p ? power(a * a % m, p / 2, m) * (p & 1 ? a : 1) % m : 1;
}
long long S[5005][5005], ans;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  S[0][0] = 1;
  for (int i = 1; i <= k; ++i)
    for (int j = 1; j <= k; ++j)
      S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % md;
  for (long long j = 0, n_j = 1; j <= min(n, k); (n_j *= n - j++) %= md)
    (ans += S[k][j] * n_j % md * power(m, n - j)) %= md;
  cout << ans * power(m, (md - 2) * n) % md << endl;
}
