#include <bits/stdc++.h>
using namespace std;
inline long long gi() {
  long long x = 0;
  bool f = 0;
  char ch = getchar();
  while (!isdigit(ch)) f |= ch == '-', ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return f ? -x : x;
}
inline void pi(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) pi(x / 10);
  putchar(48 + x % 10);
}
inline void pin(long long x) {
  pi(x);
  putchar('\n');
}
inline void pib(long long x) {
  pi(x);
  putchar(' ');
}
const long long N = 5e3 + 5;
const long long mo = 998244353;
long long f[N][N];
inline long long ksm(long long a, long long b = mo - 2) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mo;
    a = a * a % mo;
    b >>= 1;
  }
  return res;
}
long long n, m, k;
signed main() {
  n = gi();
  m = gi();
  k = gi();
  f[0][0] = 1;
  for (register long long i = (1); i <= (k); ++i)
    for (register long long j = (1); j <= (i); ++j) {
      f[i][j] =
          (f[i - 1][j] * j % mo + f[i - 1][j - 1] * (n - j + 1) % mo) % mo;
    }
  long long ans = 0;
  for (register long long i = (1); i <= (k); ++i)
    ans = (ans + f[k][i] * ksm(ksm(m, i)) % mo) % mo;
  pin(ans);
}
