Problem Statement

You are given integers $N$ and $M$. Find the number of arrays $A=[A_1, A_2, \ldots, A_N]$ of length $N$ such that the following conditions hold:

• $2 \le A_i \le M$ ($1 \leq i \leq N$)
• There exists a permutation $P=[P_1,P_2,\ldots,P_N]$ of integers from $1$ to $N$ with the following property:
• For every $i$ from $1$ to $N$, $A_i$ equals the length of the longest increasing subsequence of the sequence $[P_1, P_2, \ldots, P_{i-1}, P_{i+1}, \ldots, P_{N-1}, P_N]$.

As this number can be very large, output it modulo some prime $Q$.

Constraints

• $3 \le N \le 5000$.
• $2 \le M \le N-1$.
• $10^8 \le Q \le 10^9$
• $Q$ is a prime.

Input

Input is given from Standard Input in the following format:

N M Q

Output

Print the answer modulo $Q$.