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
#include<cstdio>

int A[1<<21];

void sort(int start, int end) {
	
}

int main() {
	int n;
	int t;
	int m;
	
	scanf("%d %d", &n, &t);
	m = 1 << n;
	for (int i = 0; i < m; i++) {
		scanf("%d", A+i);
	}
	
	if (t % 2 == 0) {
		for (int i = 0; i < m; i++) {
			printf("%d ", A[i]);
		}
	} else {
		for (int i = 0; i < m; i++) {
			printf("%d ", A[m-i-1]);
		}
	}
	printf("\n");
	
	return 0;
}