#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf = 1e12+5;
int n, N, tot, b[65550], c[65550], ans[65550];
ll k, a[65550], f[131090];
ll calc(int u, int x){
	if(u >= N) f[u] = (b[u - N] >= x ? 0 : inf);
	else f[u] = calc(u << 1, x) + min(a[u], calc(u << 1 | 1, x));
	return f[u];
}
ll dfs(int u, ll x, int dep){
	if(dep < 0){ ans[++tot] = b[u - N]; return 0; }
	int l = 1, r = 1 << n, md;
	ll res = 0;
	while(l < r){
		md = l + r + 1 >> 1;
		if(calc(u, md) <= x) l = md;
		else r = md - 1;
	}
	if(c[l] >> dep & 1){
		res += dfs(u << 1 | 1, x - f[u << 1], dep - 1);
		res += dfs(u << 1, x - res, dep - 1);
	}else{
		res += dfs(u << 1, x - f[u] + f[u << 1], dep - 1);
		if(res + f[u << 1 | 1] > x) res += a[u];
		res += dfs(u << 1 | 1, x - res, dep - 1);
	}
	return res;
}
void solve(){
	tot = 0;
	int i;
	scanf("%d%lld", &n, &k); N = 1 << n;
	for(i = 1; i < N; i++) scanf("%lld", &a[i]);
	for(i = 0; i < N; i++){
		scanf("%d", &b[i]); c[b[i]] = i;
	}
	dfs(1, k, n - 1);
	for(i = 1; i <= tot; i++) printf("%d ", ans[i]);
	printf("\n");
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--) solve();
	return 0;
}