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
#include <cstdio>
#include <cstddef>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#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

int pow2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 
			  8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576};



int main() {
	ios_base::sync_with_stdio(false);

	int n;
	unsigned long long t;
	cin >> n >> t;
	unsigned long long a[pow2[n]];
	REP(i, pow2[n]) cin >> a[i];
	if(t % 2 == 0)
		REP(i, pow2[n]) cout << a[i] << " ";
	else
		FORD(i, pow2[n] - 1, 0) cout << a[i] << " ";


	return 0;
}