#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int MAX = 5e3 + 5;
const long long MAX2 = 11;
const long long MOD = 998244353;
const long long MOD2 = 1000000006;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 316;
long long n, m, k, dp[MAX], ls, nw[MAX];
inline long long pw(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = ret * x % MOD;
    x = x * x % MOD;
    y >>= 1;
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  m = pw(m, MOD - 2);
  ls = 1;
  for (int i = 1; i <= k; ++i) {
    ls = ls * (n - i + 1) % MOD * m % MOD;
    nw[i] = 1;
    dp[i] = ls;
    for (int j = i - 1; j >= 1; --j) {
      nw[j] = (nw[j - 1] - nw[j] * (i - 1)) % MOD;
      dp[i] = (dp[i] - nw[j] * dp[j]) % MOD;
    }
  }
  if (dp[k] < 0) dp[k] += MOD;
  cout << dp[k] << '\n';
  return 0;
}
