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
65
66
67
68
69
70
71
72
73
74
75
#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;
const int INFTY=20000000;
const int MAX=1100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int dp[MAX][MAX];
int min(vector<int> per){
	vector<int> tmp;
	int k=0;
	while(per.size()!=1){
		k++;
		tmp.clear();
		if(per[0]>per[1]) tmp.pb(per[0]);
		loop(i,1,per.size()-1){
			if(per[i]>per[i-1]&&per[i]>per[i+1]){
				tmp.pb(per[i]);
			}
		}
		if(per[per.size()-1]>per[per.size()-2]) tmp.pb(per[per.size()-1]);
		per.clear();
		for(auto j : tmp){ 
			per.pb(j);
		}
	}
	return k;
}
int main(){
	ios_base::sync_with_stdio(0);
	int n,k;
	ll p;
	cin>>n>>k>>p;
	if(k>10){ pln(0); return 0; }
	dp[1][0]=1;
	vector<int> perm;
	//loop(i,2,n+1){
		ll cnt = 0; 
		perm.clear();
		loop(j,0,n) perm.pb(j);
		do{
			//dp[i][min(perm)]++;
			if(min(perm)==k) cnt++;
		}while(next_permutation(ALL(perm)));
	//}
	/*loop(i,1,n+1){
		loop(j,0,7){
			ps(dp[i][j]);
		}
		entr;
	}*/
	pln(cnt%p);
}