Problem Statement

You are given a prime number $P$, which you don't like.

Let's call an array of integers $A_1, A_2, \dots, A_N$ good, if it is possible to reorder the elements in such a way that no prefix sum is divisible by $P$ (that is, there is no $i$ with $1 \le i \le N$ and $A_1 + A_2 + \dots + A_i \equiv 0 \bmod P$ after the reordering).

Consider all $(P-1)^N$ arrays of length $N$ with elements from $1$ to $P-1$. How many of them are good?

As this number can be very big, output it modulo $998244353$.

Constraints

• $1 \le N \le 5000$
• $2 \le P \le 10^8$
• $P$ is a prime.

Input

Input is given from Standard Input in the following format:

N P

Output

Output the number of good arrays modulo $998244353$.