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

using namespace std;

int n, t;

int main() {
    scanf("%d %d", &n, &t);
    vector<int> cards;
    int card;

    for (int i = 0; i < 1 << n; i++) {
        scanf("%d", &card);
        cards.push_back(card);
    }

    if (t%2) {
        for (int i = (1 << n) - 1; i >= 0; i--) {
            printf("%d ",cards[i]);
        }
    } else {
        for (int i = 0; i < 1 << n; i++) {
            printf("%d ",cards[i]);
        }        
    }
    
    return 0;
}