Problem: Consider the following experiment. You have a deck of m cards, and exactly one card is a joker. n times, you do the following: shuffle the deck, take the top card of the deck, look at it and return it into the deck.

Let x be the number of times you have taken the joker out of the deck during this experiment. Assuming that every time you shuffle the deck, all m! possible permutations of cards are equiprobable, what is the expected value of x^k? Print the answer modulo 998244353.

Input

The only line contains three integers n, m and k (1 ≤ n, m < 998244353, 1 ≤ k ≤ 5000).

Output

Print one integer — the expected value of x^k, taken modulo 998244353 (the answer can always be represented as an irreducible fraction a/b, where b mod 998244353 ≠ 0; you have to print a ⋅ b^{-1} mod 998244353).

Examples

Input


1 1 1


Output


1


Input


1 1 5000


Output


1


Input


2 2 2


Output


499122178


Input


998244352 1337 5000


Output


326459680

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int power(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1) {
    if (y & 1) ret = 1LL * ret * x % MOD;
    x = 1LL * x * x % MOD;
  }
  return ret;
}
namespace FFT {
const int LN = 21;
const int N = 1 << LN;
const int PRIMITIVE_ROOT = 3;
int root[N];
void init_fft() {
  const int UNITY = power(PRIMITIVE_ROOT, (MOD - 1) >> LN);
  root[0] = 1;
  for (int i = 1; i < N; ++i) {
    root[i] = 1LL * UNITY * root[i - 1] % MOD;
  }
}
void fft(int n, vector<int> &a, bool invert) {
  for (int i = 1, j = 0; i < n; ++i) {
    int bit = n >> 1;
    for (; j & bit; bit >>= 1) j ^= bit;
    j ^= bit;
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 2; len <= n; len <<= 1) {
    int wlen = (invert ? root[N - N / len] : root[N / len]);
    for (int i = 0; i < n; i += len) {
      int w = 1;
      for (int j = 0; j < len >> 1; ++j) {
        int u = a[i + j];
        int v = 1LL * a[i + j + len / 2] * w % MOD;
        a[i + j] = (u + v) % MOD;
        a[i + j + len / 2] = (u - v + MOD) % MOD;
        w = 1LL * w * wlen % MOD;
      }
    }
  }
  if (invert) {
    int inv = power(n, MOD - 2);
    for (int i = 0; i < n; ++i) a[i] = 1LL * a[i] * inv % MOD;
  }
}
}  // namespace FFT
vector<int> multiply(vector<int> a, vector<int> b) {
  int len = (a.size() + b.size() == 2
                 ? 1
                 : 1 << (32 - __builtin_clz(a.size() + b.size() - 2)));
  a.resize(len);
  b.resize(len);
  FFT::fft(len, a, false);
  FFT::fft(len, b, false);
  a.resize(len);
  for (int i = 0; i < len; ++i) a[i] = 1LL * a[i] * b[i] % MOD;
  FFT::fft(len, a, true);
  return a;
}
const int N = 5005;
int fact[N];
int ifact[N];
int main() {
  fact[0] = 1;
  for (int i = 1; i < N; ++i) fact[i] = 1LL * fact[i - 1] * i % MOD;
  ifact[N - 1] = power(fact[N - 1], MOD - 2);
  for (int i = N - 2; i >= 0; --i)
    ifact[i] = 1LL * ifact[i + 1] * (i + 1) % MOD;
  FFT::init_fft();
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  vector<int> e(k + 1), f(k + 1);
  for (int i = 0; i <= k; ++i) {
    e[i] = i & 1 ? MOD - ifact[i] : ifact[i];
    f[i] = 1LL * power(i, k) * ifact[i] % MOD;
  }
  vector<int> S = multiply(e, f);
  int ans = 0;
  int P = 1;
  int im = power(m, MOD - 2);
  int a = 1;
  for (int i = 0; i <= min(n, k); ++i) {
    ans = (ans + 1LL * P * S[i] % MOD * a) % MOD;
    P = 1LL * P * (n - i) % MOD;
    a = 1LL * a * im % MOD;
  }
  printf("%d\n", ans);
  return 0;
}