Find the number of the possible tuples of sequences (A_0,A_1,...,A_N) that satisfy all of the following conditions, modulo M:

* For every i (0\leq i\leq N), A_i is a sequence of length i consisting of integers between 1 and K (inclusive);
* For every i (1\leq i\leq N), A_{i-1} is a subsequence of A_i, that is, there exists 1\leq x_i\leq i such that the removal of the x_i-th element of A_i would result in a sequence equal to A_{i-1};
* For every i (1\leq i\leq N), A_i is lexicographically larger than A_{i-1}.

Constraints

* 1 \leq N,K \leq 300
* 2 \leq M \leq 10^9
* N, K and M are integers.

Input

Input is given from Standard Input in the following format:


N K M


Output

Print the number of the possible tuples of sequences (A_0,A_1,...,A_N), modulo M.

Examples

Input

2 2 100


Output

5


Input

4 3 999999999


Output

358


Input

150 150 998244353


Output

186248260
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
	
	static long M;
	static int N, K;
	
	static long[][] comb;
	static long[][] table;
	static long[][] acumTable;
	
	static void calcComb() {
		comb = new long[N + 1][];
		comb[0] = new long[1];
		comb[0][0] = 1;
		for (int i = 1; i <= N; i++) {
			comb[i] = new long[i + 1];
			comb[i][0] = comb[i][i] = 1;
			for (int j = 1; j < i; j++) {
				comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % M;
			}
		}
	}
	
	static long calc() {
		table = new long[N + 1][K + 1];
		acumTable = new long[N + 1][K + 1];
		for (int n = 0; n <= N; n++) {
			for (int k = 0; k <= K; k++) {
				if (n == 0) {
					table[n][k] = 1;
					acumTable[n][k] = (table[n][k] + (k > 0 ? acumTable[n][k - 1] : 0)) % M;
					continue;
				}
				table[n][k] = 0;
				for (int i = 1; i <= n; i++) {
					long tmp = (comb[n - 1][i - 1] * table[n - i][k]) % M;
					long tmp2 = (acumTable[i - 1][K] + M - acumTable[i - 1][k]) % M;
					table[n][k] += tmp * tmp2;
					table[n][k] %= M;
				}
				acumTable[n][k] = (table[n][k] + (k > 0 ? acumTable[n][k - 1] : 0)) % M;
			}
		}
		return table[N][0];
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		N = sc.nextInt();
		K = sc.nextInt();
		M = sc.nextInt();
		calcComb();
		System.out.println(calc());
	}
}
