#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
const double PI = acos(-1);
const int INF = 0x3f3f3f3f;
const int NINF = 0x3f3f3f40;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0x3f3f3f3f3f3f3f40;
ll binpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll modInv(ll a) { return binpow(a, MOD - 2); }
const int mxK = 5001;
int n, m, k;
ll dp[mxK][mxK];
int main() {
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> k;
  dp[1][1] = n;
  for (int i = (2); i < (k + 1); ++i) {
    for (int j = (1); j < (k + 1); ++j) {
      dp[i][j] = (dp[i - 1][j] * j) % MOD;
      dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] * (n - j + 1)) % MOD;
    }
  }
  ll res = 0;
  for (int i = (1); i < (k + 1); ++i) {
    res = (res + dp[k][i] * modInv(binpow(m, i))) % MOD;
  }
  cout << res << '\n';
  return 0;
}
