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
#include <bits/stdc++.h>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;

#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())

#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXSIZE 10010

int perm[MAXSIZE];
int odp[MAXSIZE];

int main(){	//prosze tylko o koszulke, nic wiecej mi do szczescia nie potrzeba
	
	ios::sync_with_stdio(0); cin.tie(0);
	
	LL n,k,p;
	cin>>n>>k>>p;
	
	if(k==1){
		LL par=1;
		REP(i,n-1){
			par*=2;
			par%=p;
		}
		cout<<par;
		return 0;
	}
	
	REP(i,n)
		perm[i]=i+1;	
	do{
		VI temp;
		VI point;
		REP(i,n)
			temp.PB(perm[i]);
		
		int t=0;
		while(SIZE(temp)>1){
			VI bufor;
			REP(i,SIZE(temp)){
				if(temp[i]<temp[max(0,i-1)]||temp[i]<temp[min(i+1,SIZE(temp))])
					bufor.PB(i);
			}
			FORD(i,SIZE(bufor)-1,0)
				temp.erase(temp.begin()+bufor[i]);
			t++;
		}
		odp[t]++;
		odp[t]%=p; //bez sensu, ale co tam
	}while(next_permutation(perm,perm+n));
	
	cout<<odp[k]%p;
	return 0;
}