#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int mod = 998244353;
void reduce(int &a) { a += a >> 31 & mod; }
int Mod(int x) { return x >= mod ? x - mod : x; }
long long read() {
  long long x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
  return x * f;
}
void print(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
int qpow(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = (long long)a * a % mod)
    if (b & 1) ans = (long long)ans * a % mod;
  return ans;
}
const int N = 10000010;
int n, k, p;
int prime[N], tot, pk[N], inv[N];
int S[N], ans;
void init(int n) {
  inv[1] = pk[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!pk[i]) pk[prime[++tot] = i] = qpow(i, k), inv[i] = qpow(i, mod - 2);
    for (int j = 2, k; j <= tot && (k = i * prime[j]) <= n; j++) {
      pk[k] = (long long)pk[i] * pk[prime[j]] % mod;
      inv[k] = (long long)inv[i] * inv[prime[j]] % mod;
      if (i % prime[j] == 0) break;
    }
  }
}
void solve1() {
  int res1 = 1, res2 = qpow(mod + 1 - p, n), iv = qpow(mod + 1 - p, mod - 2),
      C = 1;
  for (int i = 1; i <= n; i++) {
    res1 = (long long)res1 * p % mod, res2 = (long long)res2 * iv % mod;
    C = (long long)C * (n - i + 1) % mod * inv[i] % mod;
    ans = (ans + (long long)res1 * res2 % mod * C % mod * pk[i]) % mod;
  }
  print(ans), putchar('\n');
}
void solve2() {
  int res = 1, C = 1;
  S[k] = 1;
  for (int i = k - 1; i; i--) {
    C = (long long)C * (n - i - 1) % mod * inv[k - i] % mod;
    res = (long long)res * (mod - p) % mod;
    S[i] =
        ((long long)S[i + 1] * (mod + 1 - p) % mod + (long long)C * res) % mod;
  }
  C = res = 1;
  for (int i = 1; i <= k; i++) {
    res = (long long)res * p % mod;
    C = (long long)C * (n - i + 1) % mod * inv[i] % mod;
    ans = (ans + (long long)S[i] * C % mod * pk[i] % mod * res) % mod;
  }
  print(ans), putchar('\n');
}
int main() {
  n = read(), p = qpow(read(), mod - 2), k = read();
  if (p == 1) {
    print(qpow(n, k)), putchar('\n');
    return 0;
  }
  init(k);
  if (n < k)
    solve1();
  else
    solve2();
  return 0;
}

### Prompt

In cpp, your task is to solve the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int mod = 998244353;
void reduce(int &a) { a += a >> 31 & mod; }
int Mod(int x) { return x >= mod ? x - mod : x; }
long long read() {
  long long x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
  return x * f;
}
void print(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
int qpow(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = (long long)a * a % mod)
    if (b & 1) ans = (long long)ans * a % mod;
  return ans;
}
const int N = 10000010;
int n, k, p;
int prime[N], tot, pk[N], inv[N];
int S[N], ans;
void init(int n) {
  inv[1] = pk[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!pk[i]) pk[prime[++tot] = i] = qpow(i, k), inv[i] = qpow(i, mod - 2);
    for (int j = 2, k; j <= tot && (k = i * prime[j]) <= n; j++) {
      pk[k] = (long long)pk[i] * pk[prime[j]] % mod;
      inv[k] = (long long)inv[i] * inv[prime[j]] % mod;
      if (i % prime[j] == 0) break;
    }
  }
}
void solve1() {
  int res1 = 1, res2 = qpow(mod + 1 - p, n), iv = qpow(mod + 1 - p, mod - 2),
      C = 1;
  for (int i = 1; i <= n; i++) {
    res1 = (long long)res1 * p % mod, res2 = (long long)res2 * iv % mod;
    C = (long long)C * (n - i + 1) % mod * inv[i] % mod;
    ans = (ans + (long long)res1 * res2 % mod * C % mod * pk[i]) % mod;
  }
  print(ans), putchar('\n');
}
void solve2() {
  int res = 1, C = 1;
  S[k] = 1;
  for (int i = k - 1; i; i--) {
    C = (long long)C * (n - i - 1) % mod * inv[k - i] % mod;
    res = (long long)res * (mod - p) % mod;
    S[i] =
        ((long long)S[i + 1] * (mod + 1 - p) % mod + (long long)C * res) % mod;
  }
  C = res = 1;
  for (int i = 1; i <= k; i++) {
    res = (long long)res * p % mod;
    C = (long long)C * (n - i + 1) % mod * inv[i] % mod;
    ans = (ans + (long long)S[i] * C % mod * pk[i] % mod * res) % mod;
  }
  print(ans), putchar('\n');
}
int main() {
  n = read(), p = qpow(read(), mod - 2), k = read();
  if (p == 1) {
    print(qpow(n, k)), putchar('\n');
    return 0;
  }
  init(k);
  if (n < k)
    solve1();
  else
    solve2();
  return 0;
}

```