#include <bits/stdc++.h>
#define ll long long
//#define int long long
using namespace std;

const int maxn = 105000;
const int maxp = maxn*30;

struct segment
{
	int tot;
	int t[maxp],tn;
	int seg[maxp],lc[maxp],rc[maxp];
	
	void init()
	{
		tot=0; tn=0;
	}
	void delp(int &x)
	{
		t[++tn]=x;
		x=0;
	}
	int newnode()
	{
		int x;
		if(tn) x=t[tn--];
		else x=++tot;
		
		seg[x]=lc[x]=rc[x]=0;
		return x;
	}
	int loc;
	ll insr(int &x,const int l,const int r)
	{
		if(!x) x=newnode();
		seg[x]++;
		if(l==r) return 0;
		int mid=(l+r)>>1;
		if(loc<=mid) return seg[rc[x]]+insr(lc[x],l,mid);
		else return insr(rc[x],mid+1,r);
	}
	ll dell(int &x,const int l,const int r)
	{
		seg[x]--;
		if(l==r)
		{
			if(!seg[x]) delp(x);
			return 0;
		}
		int mid=(l+r)>>1;
		ll ret=0;
		if(loc<=mid) ret= dell(lc[x],l,mid);
		else ret= seg[lc[x]]+ dell(rc[x],mid+1,r);
		
		if(!seg[x]) delp(x);
		return ret;
	}
	ll delr(int &x,const int l,const int r)
	{
		seg[x]--;
		if(l==r)
		{
			if(!seg[x]) delp(x);
			return 0;
		}
		int mid=(l+r)>>1;
		ll ret=0;
		if(loc<=mid) ret= seg[rc[x]]+delr(lc[x],l,mid);
		else ret=delr(rc[x],mid+1,r);
		
		if(!seg[x]) delp(x);
		return ret;
	}
}seg;

//         r   l   rt  num
set< tuple<int,int,int,ll> >rtS;
//       num  r
set< pair<ll,int> >numS;

int a[maxn],n;
void build(const int l,const int r)
{
	int rt=0;
	ll num=0;
	for(int i=l;i<=r;i++)
	{
		seg.loc=a[i];
		num+= seg.insr(rt,1,n);
	}
	rtS.emplace( r,l,rt,num );
	numS.emplace( num,r );
}
void solve(const int pos)
{
	auto it= rtS.lower_bound( make_tuple( pos,0,0,0ll ) );
	auto [r,l,rt,num]= *it;
	
	rtS.erase(it);
	numS.erase( make_pair(num,r) );
	
	int mid=(l+r)>>1;
	if(pos<=mid)
	{
		for(int i=l;i<=pos;i++)
		{
			seg.loc=a[i];
			num-=seg.dell(rt,1,n);
		}
		
		if(pos+1<=r)
		{
			rtS.emplace(r,pos+1,rt,num);
			numS.emplace( num,r );
		}
		if(l<=pos-1) build(l,pos-1);
	}
	else
	{
		for(int i=r;i>=pos;i--)
		{
			seg.loc=a[i];
			num-=seg.delr(rt,1,n);
		}
		
		if(l<=pos-1)
		{
			rtS.emplace(pos-1,l,rt,num);
			numS.emplace( num,pos-1 );
		}
		if(pos+1<=r) build(pos+1,r);
	}
}

int main()
{
	//freopen("tmp.in","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	mt19937 rng(58);
	int Tcase=10; cin>>Tcase;
	int sumn=0;
	while(Tcase--)
	{
		cin>>n;
		sumn+=n;
		assert(sumn<=1000000);
//		n=100000;
		for(int i=1;i<=n;i++) /*a[i]=rng()%n+1;*/cin>>a[i];
		
		rtS.clear();
		numS.clear();
		seg.init();
		
		build(1,n);
		
		ll lastans;
//		vector<int> perm(n+5);
//		for(int i=1;i<=n;i++)perm[i]=i;
//		random_shuffle(perm.begin()+1,perm.begin()+n+1,[&](int x){return rng()%x;});
		vector<int> vis(n+5);
		for(int i=1;i<=n;i++)
		{
		//	cerr<<i<<" : ";
		//	for(auto it:numS) cerr<< it.first <<' '<< it.second <<' ';
		//	cerr<<endl;
			
			auto it=numS.end();
			it--;
			lastans=it->first;
			cout<< lastans << " \n"[i==n];
			
			ll p; cin>>p; p^=lastans;
			assert((1<=p and p<=n and not vis[p]));
			solve(p);
		}
	}
	
	return 0;
}