Boring Game

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include <vector>
#include <iterator>
#include <utility>
#include <sstream>
#include <limits>
#include <numeric>
#include <functional>
using namespace std;
#define gc getchar()
#define mem(a) memset(a,0,sizeof(a))
//#define sort(a,n,int) sort(a,a+n,less<int>())

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef char ch;
typedef double db;

const double PI=acos(-1.0);
const double eps=1e-6;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;
const int N=1e6+10;
const int mod=1e9+7;

vector<int> node[N];
int main()
{
	int T = 0;
	cin >> T;
	while(T--)
	{
		int n , k , L;
		cin >> n >> k;
		L = n << (k+1);		
		for(int i = 1;i <= L;i++)
		{
			node[i].clear();
            int x;	
			cin >> x;
			node[i].push_back(x); 
		}
		int mid = 1;
		int p = 0;
		for(int i = 1;i <= k;i++)
		{
			mid = (mid + L)/2;
			for(int j = mid + 1;j <= L;j++)
            {
                p = mid - (j - (mid+1)); 
                reverse(node[p].begin() , node[p].end());
                node[j].insert(node[j].begin() , node[p].begin() , node[p].end());
                node[p].clear(); 
            }
		}
		for(int i = L-n*2+1;i <= L;i++)
		{
			for(int j = 0;j < node[i].size();j++)
			{
				if(j == node[i].size()-1  &&  i == L)
				{
					cout << node[i][j];
				}
				else
				{
					cout << node[i][j] <<" ";
				}
			}
		 } 
		 cout << endl;
	}
}