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
#include<cstdio>
#include<vector>
#include<algorithm>
#include<set>
#include<iostream>
#include<map>


using namespace std;

#define REP(i,n) for(int i=0; i<(int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int,int> PI;
typedef vector<PI> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int n,m,k,l, t, test = 1;
const int INF = 1000 * 1000 * 1000 ;
const int MAKSN = 2* 1000 * 1000 + 13; // UZUPElnic

int tab[MAKSN];

void readIn()
{
	cin >> n >> t;
	t = t % 2;
	m = (1 << n);

	// cout << m << "\n";

	REP(i, m) 
	{
		cin >> k;
		tab[i] = k;
	}


}
//  2 4 1 5
//  5 1 4 2

void tasRek(int beg, int end) 
{
	int mid = (beg+end) >> 1;

	if(beg + 1 == end) {
		swap (tab[beg], tab[end]);
		return;
	}
	tasRek(beg, mid);
	tasRek(mid+1, end);

	int half = (end-beg) >> 1;
	for(int i=0; i<=half; i++)
	{
		swap(tab[beg+i], tab[mid+1+i]);
	}
}



void solve()
{
	if(t) 
		tasRek(0, m-1);

	REP(i, m){
		cout << tab[i] << " ";
	}
	cout << "\n";
}

void zeruj()
{
}

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

	// cin >> test;
    REP(i, test)
    {
        zeruj();
        readIn();
        solve();
    }

    return 0;
}