#include<bits/stdc++.h>
using namespace std;
namespace sgt {
	int sgt[2050000][3],sgtcnt;
	int newnode() {
		sgtcnt++;
		sgt[sgtcnt][0]=sgt[sgtcnt][1]=sgt[sgtcnt][2]=0;
		return sgtcnt;
	}
	void update(int p,int q,int s,int t,int x,int y) {
		sgt[q][0]=sgt[p][0];sgt[q][1]=sgt[p][1];sgt[q][2]=sgt[p][2]+y;
		if (s==t) return;
		int mid=(s+t)/2;
		if (x<=mid) {
			sgt[q][0]=newnode();
			update(sgt[p][0],sgt[q][0],s,mid,x,y);
		}
		else {
			sgt[q][1]=newnode();
			update(sgt[p][1],sgt[q][1],mid+1,t,x,y);
		}
	}
	int getsum(int p,int s,int t,int l,int r) {
		if (l>r) return 0;
		if ((l<=s)&&(t<=r)) return sgt[p][2];
		int mid=(s+t)/2;
		if (r<=mid) return getsum(sgt[p][0],s,mid,l,r);
		if (l>mid) return getsum(sgt[p][1],mid+1,t,l,r);
		return getsum(sgt[p][0],s,mid,l,r)+getsum(sgt[p][1],mid+1,t,l,r);
	}
}
int T,n,a[105000],rt[105000];
map<int,long long> mp;
multiset<long long,greater<long long> > ms;
set<int> st_getlarger;
set<int,greater<int> > st_getsmaller;
void split(int l,int r,int x) {
	long long tmp=mp[l-1];ms.erase(ms.find(tmp));
	long long ansx=sgt::getsum(rt[r],1,n,1,a[x]-1)-sgt::getsum(rt[x],1,n,1,a[x]-1)
	+sgt::getsum(rt[x-1],1,n,a[x]+1,n)-sgt::getsum(rt[l-1],1,n,a[x]+1,n);
	if (x-l<r-x) {
		long long newans=0,midans=ansx;
		for (int i=l;i<x;i++) {
			newans+=sgt::getsum(rt[i-1],1,n,a[i]+1,n)-sgt::getsum(rt[l-1],1,n,a[i]+1,n);
			midans+=sgt::getsum(rt[r],1,n,1,a[i]-1)-sgt::getsum(rt[x],1,n,1,a[i]-1);
		}
		mp[l-1]=newans;ms.insert(newans);
		mp[x]=tmp-newans-midans;ms.insert(tmp-newans-midans);
	} else {
		long long newans=0,midans=ansx;
		for (int i=x+1;i<=r;i++) {
			newans+=sgt::getsum(rt[r],1,n,1,a[i]-1)-sgt::getsum(rt[i],1,n,1,a[i]-1);
			midans+=sgt::getsum(rt[x-1],1,n,a[i]+1,n)-sgt::getsum(rt[l-1],1,n,a[i]+1,n);
		}
		mp[x]=newans;ms.insert(newans);
		mp[l-1]=tmp-newans-midans;ms.insert(tmp-newans-midans);
	}
}
int main() {
	scanf("%d",&T);
	while (T--) {
		scanf("%d",&n);
		sgt::sgtcnt=0;
		long long cur=0;
		for (int i=1;i<=n;i++) {
			scanf("%d",&a[i]);
			cur+=sgt::getsum(rt[i-1],1,n,a[i]+1,n);
			rt[i]=sgt::newnode();
			sgt::update(rt[i-1],rt[i],1,n,a[i],1);
		}
		mp.clear();ms.clear();st_getsmaller.clear();st_getlarger.clear();
		mp[0]=cur;ms.insert(cur);
		mp[n+1]=0;ms.insert(0);
		st_getsmaller.insert(0);st_getsmaller.insert(n+1);
		st_getlarger.insert(0);st_getlarger.insert(n+1);
		for (int i=1;i<=n;i++) {
			cur=*ms.begin();
			printf("%lld",cur);
			if (i<n) printf(" ");
			else printf("\n");
			long long x=0;
			scanf("%lld",&x);
			int y=(int)(x^cur);
			int l=*st_getsmaller.lower_bound(y),r=*st_getlarger.lower_bound(y);
			split(l+1,r-1,y);
			st_getsmaller.insert(y);st_getlarger.insert(y);
		}
	}
	return 0;
}