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
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

//inline int life_time(int* perm, int size) {
//	int work[2][size];
//	int work_size[2] = { size, 0 };
//	int selector = 0;
//	int time = 0;
//
//	memcpy(work[0], perm, size * sizeof(int));
//
//	while (work_size[selector] > 1) {
//		++time;
//
//		work_size[selector ^ 1] = 0;
//		if (work[selector][0] > work[selector][1]) {
//			work[selector ^ 1][0] = work[selector][0];
//			++work_size[selector ^ 1];
//		}
//
//		for (int i = 1; i < work_size[selector] - 1; ++i) {
//			if (work[selector][i] > work[selector][i - 1] && work[selector][i] > work[selector][i + 1]) {
//				work[selector ^ 1][work_size[selector ^ 1]] = work[selector][i];
//				++work_size[selector ^ 1];
//			}
//		}
//
//		if (work[selector][work_size[selector] - 1] > work[selector][work_size[selector] - 2]) {
//			work[selector ^ 1][work_size[selector ^ 1]] = work[selector][work_size[selector] - 1];
//			++work_size[selector ^ 1];
//		}
//
//		selector ^= 1;
//	}
//
//	return time;
//}
//
//void full_check_len(int len) {
//	int base[len + 1];
//	long long hist[len + 1] = { };
//
//	for (int i = 0; i < len; ++i) {
//		base[i] = i + 1;
//	}
//	base[len] = 0;
//
//	do {
//		++hist[life_time(base, len)];
//	} while (next_permutation(base, base + len));
//
//	cout << len << ": ";
//	for (int i = 0; i <= len; ++i) {
//		cout << hist[i] << " ";
//	}
//	cout << endl;
//}
//
//void gen() {
//	for (int i = 9; i < 10; ++i) {
//		full_check_len(i);
//	}
//}

long long mem[16][16] {
		{0},
		{1, 0},
		{0, 2, 0},
		{0, 4, 2, 0},
		{0, 8, 16, 0, 0},
		{0, 16, 100, 4, 0, 0},
		{0, 32, 616, 72, 0, 0, 0},
		{0, 64, 4024, 952, 0, 0, 0, 0},
		{0, 128, 28512, 11680, 0, 0, 0, 0, 0},
		{0, 256, 219664, 142800, 160, 0, 0, 0, 0, 0},
		{0, 512, 1831712, 1788896, 7680, 0, 0, 0, 0, 0, 0},
		{0, 1024, 16429152, 23252832, 233792, 0, 0, 0, 0, 0, 0, 0},
		{0, 2048, 157552000, 315549312, 5898240, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 4096, 1606874944, 4483860928, 136280832, 0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 8192, 17350247552, 66800134784, 3027900672, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}

};

void solve() {
	long long size;
	long long time;
	long long mod;

	cin >> size >> time >> mod;

	if (size <= 14) {
		cout << mem[size][time] % mod << endl;
		return;
	}

	if (time == 1) {
		long long mult = 1;

		for (int i = 1; i < size; ++i) {
			mult *= 2;
			mult %= mod;
		}

		cout << mult << endl;
		return;
	}

	cout << 0 << endl;

}

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(0);

	solve();

	return 0;
}