#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
inline int add(int x, int y) {
  int res = x + y;
  while (res >= MOD) res -= MOD;
  return res;
}
inline int mul(int x, int y) { return (1LL * x * y) % MOD; }
int modpow(int x, int p) {
  int res = 1;
  while (p) {
    if (p & 1) res = mul(res, x);
    x = mul(x, x);
    p /= 2;
  }
  return res;
}
inline int invert(int x) { return modpow(x, MOD - 2); }
const int N = 5000 + 5;
int dp[N][N];
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  int n, m, k;
  cin >> n >> m >> k;
  dp[1][1] = n;
  for (int i = 1; i < k; ++i) {
    for (int j = 1; j < k + 1; ++j) {
      dp[i + 1][j + 1] = add(dp[i + 1][j + 1], mul(n - j, dp[i][j]));
      dp[i + 1][j] = add(dp[i + 1][j], mul(j, dp[i][j]));
    }
  }
  int ans = 0;
  int inv = invert(m);
  int cd = inv;
  for (int i = 1; i < k + 1; ++i) {
    ans = add(ans, mul(dp[k][i], cd));
    cd = mul(cd, inv);
  }
  cout << ans << '\n';
}
