#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 5, p = 998244353;
int s[N][N];
int qmi(int a, int b) {
  int res = 1;
  for (; b; b >>= 1) {
    if (b & 1) res = 1ll * res * a % p;
    a = 1ll * a * a % p;
  }
  return res;
}
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 <= i; j++)
      s[i][j] = (s[i - 1][j - 1] + 1ll * j * s[i - 1][j]) % p;
  int res = 0, q = qmi(m, p - 2);
  for (int j = 0; j <= k; j++) {
    int num = s[k][j];
    for (int i = n; i >= n - j + 1; i--) num = 1ll * num * i % p * q % p;
    res = (res + num) % p;
  }
  cout << (res + p) % p;
  return 0;
}
