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 <bits/stdc++.h>

using namespace std;

const int MAX_N = 1048576 + 9;

int tab[MAX_N];

int n, k;

int main()
{
    scanf("%d %d", &n, &k);

    int m = 1;

    for(int i = 0; i < n; ++i)
        m *= 2;

    for(int i = 0; i < m; ++i)
        scanf("%d", &tab[i]);

    if(k % 2 == 1)
        reverse(tab, tab + m);

    for(int i = 0; i < m; ++i)
        printf("%d ", tab[i]);

    printf("\n");

    return 0;
}