#include <bits/stdc++.h>
using namespace std;
const int K = 5000 + 5;
const int MOD = 998244353;
int n, p, k;
int S[K][K];
int qkPow(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = 1ll * a * a % MOD)
    if (b & 1) ans = 1ll * a * ans % MOD;
  return ans;
}
int C(int n, int m) {
  if (n < m) return 0;
  int res = 1;
  for (int i = n; i >= n - m + 1; --i) res = 1ll * res * i % MOD;
  return res;
}
int main() {
  scanf("%d %d %d", &n, &p, &k);
  p = qkPow(p, MOD - 2);
  S[0][0] = 1;
  for (int i = 1; i <= k; ++i)
    for (int j = 1; j <= i; ++j)
      S[i][j] = (1ll * S[i - 1][j] * j % MOD + S[i - 1][j - 1]) % MOD;
  int ans = 0;
  for (int i = 0; i <= k; ++i) {
    ans = (ans + 1ll * S[k][i] * C(n, i) % MOD * qkPow(p, i) % MOD) % MOD;
  }
  printf("%d", ans);
  return 0;
}
