#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1, c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return f == 1 ? x : -x;
}
const int mod = 998244353;
inline int fix(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return fix(x + y - mod); }
inline int dec(int x, int y) { return fix(x - y); }
inline int mul(int x, int y) { return (long long)x * y % mod; }
inline void ADD(int &x, int y) { x = fix(x + y - mod); }
inline void DEC(int &x, int y) { x = fix(x - y); }
inline void MUL(int &x, int y) { x = (long long)x * y % mod; }
inline int ksm(int x, int r) {
  int ret = 1;
  for (int i = 0; (1ll << i) <= r; i++) {
    if ((r >> i) & 1) MUL(ret, x);
    MUL(x, x);
  }
  return ret;
}
inline int inv(int x) { return ksm(x, mod - 2); }
const int N = 5004;
int n, m, k, ans, s[N][N];
int main() {
  n = read();
  m = read();
  k = read();
  s[0][0] = 1;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= i; j++)
      s[i][j] = add(mul(s[i - 1][j], j), s[i - 1][j - 1]);
  for (int i = 1, fac = n; i <= k; MUL(fac, n - i), i++) {
    ADD(ans, mul(mul(s[k][i], inv(ksm(m, i))), fac));
  }
  cout << ans << "\n";
  return (0 - 0);
}
