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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <bitset>

#include <cstdint>
#include <cstring>
using namespace std;

typedef unsigned long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#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 VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

#define M 1000000007ULL

const int SIZE = 13;

 
int arr [13][4] =
{
{0, 0, 0, 0},
{2, 0, 0, 0},
{4, 2, 0, 0},
{8, 16, 0, 0},
{16, 100, 4, 0},
{32, 616, 72, 0, },
{64, 4024, 952, 0, },
{128, 28512, 11680, 0, },
{256, 219664, 142800, 160, },
{512, 1831712, 1788896, 7680,},
{1024, 16429152, 23252832, 233792, },
{2048, 157552000, 315549312, 5898240, },
{4096, 1606874944, 188893632, 136280832, }
};

int main() {

	int n, k, p;
	scanf("%d %d %d\n", &n, &k, &p);

	int res = 0;
	if (n <= 13)
	{
		if (k > 1 && k <= 5)
		{
			res = arr[n - 1][k - 1];
		}
	}
	else
	{
		if (k == 1)
			res = 1 << (n-1);

	}
	
		
	printf ("%d\n", res);


	



	return 0;
}