// created:  Sep/02/2023 20:39:26
#include<cstdio>
#include<algorithm>
#include<set>
#include<queue>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
template<typename T>void readmain(T &x)
{
	bool neg=false;
	unsigned int c=getchar();
	for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
	for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=1e5+5;
namespace seg
{
	constexpr int M=3e6;
	struct node
	{
		int ls,rs,sum;
	}s[M];
	int sta[M],top;
	void init(){for(int i=M;--i;)sta[top++]=i;}
	int newnode(){return --top,s[sta[top]]=s[0],sta[top];}
	void delnode(int x){sta[top++]=x;}
	int update(int p,int l,int r,int x,int v)
	{
		if(!p)p=newnode();
		if(r-l==1)
		{
			s[p].sum+=v;
			if(!s[p].sum)delnode(p),p=0;
			return p;
		}
		int mid=(l+r)>>1;
		if(x<mid)s[p].ls=update(s[p].ls,l,mid,x,v);
		else s[p].rs=update(s[p].rs,mid,r,x,v);
		s[p].sum=s[s[p].ls].sum+s[s[p].rs].sum;
		if(!s[p].sum)delnode(p),p=0;
		return p;
	}
	int query(int p,int l,int r,int x,int y)
	{
		if(!p)return 0;
		if(x==l&&r==y)return s[p].sum;
		int mid=(l+r)>>1;
		if(y<=mid)return query(s[p].ls,l,mid,x,y);
		if(mid<=x)return query(s[p].rs,mid,r,x,y);
		return query(s[p].ls,l,mid,x,mid)+query(s[p].rs,mid,r,mid,y);
	}
}
struct interval
{
	int l,r,rt;
	long long ans;
	friend bool operator<(interval x,interval y){return x.l<y.l;}
};
int tt,n,a[N],id[N];
set<interval> s;
priority_queue<long long> add,del;
long long query()
{
	while(!del.empty()&&add.top()==del.top())add.pop(),del.pop();
	return add.top();
}
void create(int l,int r)
{
	if(l==r)return;
	int rt=0;long long ans=0;
	F(i,l,r)ans+=seg::query(rt,0,n,a[i],n),rt=seg::update(rt,0,n,a[i],1);
	add.emplace(ans);
	s.insert({l,r,rt,ans});
}
int main()
{
	seg::init();
	read(tt);
	while(tt--)
	{
		read(n);
		F(i,0,n)read(a[i]),id[i]=i;
		sort(id,id+n,[](int u,int v){return a[u]!=a[v]?a[u]<a[v]:u<v;});
		F(i,0,n)a[id[i]]=i;
		create(0,n);
		F(_,0,n)
		{
			long long lans=query(),enc;read(enc);
			printf("%lld ",lans);
			int u=(int)(enc^lans)-1;
			auto it=prev(s.upper_bound({u,0,0,0}));
			int l=it->l,r=it->r,rt=it->rt;long long ans=it->ans;
			s.erase(it);del.emplace(ans);
			if(2*u>l+r)
			{
				for(int i=r;--i>=u;)
				{
					rt=seg::update(rt,0,n,a[i],-1);
					ans-=seg::query(rt,0,n,a[i],n);
				}
				if(l<u)
				{
					add.emplace(ans);
					s.insert({l,u,rt,ans});
				}
				create(u+1,r);
			}
			else
			{
				F(i,l,u+1)
				{
					rt=seg::update(rt,0,n,a[i],-1);
					ans-=seg::query(rt,0,n,0,a[i]+1);
				}
				if(u+1<r)
				{
					add.emplace(ans);
					s.insert({u+1,r,rt,ans});
				}
				create(l,u);
			}
		}
		while(!add.empty())add.pop();
		while(!del.empty())del.pop();
		puts("");
	}
	return 0;
}