1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int main(){
	ios_base::sync_with_stdio(0);
	ll P;
	int n,m;
	cin>>n>>m>>P;
	vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(m, vector<ll>(m, 0)));
	loop(i,0,m) loop(j,i,m) dp[0][i][j]=1;
	loop(o,1,n) {
		loop(i,0,m) {
			loop(j,i,m) {
				loop(k,0,m) {
					loop(l,k,m) {
						if((i>=k&&i<=l)||(j>=k&&j<=l)||(k>=i&&k<=j)||(l>=i&&l<=j)) {
							//cout<<"OJ"<<endl;
							dp[o][i][j] = (dp[o][i][j] + dp[o-1][k][l])%P;
						}
					}
				}
				//ps(o);ps(i);ps(j);pln(dp[o][i][j]); 
			}
		}
	}
	ll res=0;
	loop(i,0,m) loop(j,i,m) res = (res + dp[n-1][i][j])%P;
	pln(res);
}