CF1278F.Cards

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$ .

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

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