#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 5010;
long long mpow(long long x, long long e) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long magic[N][N];
int n, m, k;
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  ;
  cin >> n >> m >> k;
  magic[0][0] = 1;
  for (int i = (1); i < (N); ++i) {
    for (int j = (0); j < (N - 1); ++j) {
      magic[i][j] = (magic[i][j] + magic[i - 1][j] * j) % mod;
      magic[i][j + 1] = (magic[i][j + 1] + magic[i - 1][j] * (n - j)) % mod;
    }
  }
  long long ans = 0;
  for (int i = (1); i < (min(k, n) + 1); ++i) {
    ans = (ans + magic[k][i] * mpow(m, n - i)) % mod;
  }
  ans = ans * mpow(mpow(m, n), mod - 2) % mod;
  cout << ans << '\n';
}
