#include<iostream>
#include<cstdio>
#include<set>
#define N 100000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int l,r;
	long long res;
	bool operator < (const reads &t)const
	{
		if (res!=t.res) return res>t.res;
		else if (l!=t.l) return l<t.l;
		else return r<t.r;
	}
};
struct rds
{
	int l,r;
	long long res;
	bool operator < (const rds &t)const
	{
		return r<t.r;
	}
};
set<reads>s;
set<rds>st;
struct seg
{
	struct node
	{
		int ls,rs,data;
	};
	node tree[20*N+1];
	int length;
	void push_up(int k)
	{
		tree[k].data=tree[tree[k].ls].data+tree[tree[k].rs].data;
		return;	
	}
	int add(int k,int L,int R,int x,int d)
	{
		int nw=++length;
		tree[nw]=tree[k];
		if (L==R)
		{
			tree[nw].data+=d;
			return nw;
		}
		int mid=(L+R)>>1;
		if (x<=mid) tree[nw].ls=add(tree[nw].ls,L,mid,x,d);
		else tree[nw].rs=add(tree[nw].rs,mid+1,R,x,d);
		push_up(nw);
		return nw;
	}
	int query(int k,int L,int R,int l,int r)
	{
		if (l>r) return 0;
		if (L==l&&R==r) return tree[k].data;
		int mid=(L+R)>>1;
		if (r<=mid) return query(tree[k].ls,L,mid,l,r);
		else if (l>=mid+1) return query(tree[k].rs,mid+1,R,l,r);
		else return query(tree[k].ls,L,mid,l,mid)+query(tree[k].rs,mid+1,R,mid+1,r);
	}
};
seg T;
int ST,n,a[N+1],rt[N+1];
long long ans;
int main()
{
	int x,L,R;
	long long res,ans,rst;
	ST=read();
	while (ST--)
	{
		n=read(),s.clear(),st.clear(),T.length=ans=0;
		for (int i=1;i<=n;++i) a[i]=read(),ans+=T.query(rt[i-1],1,n,a[i]+1,n),rt[i]=T.add(rt[i-1],1,n,a[i],1);
		s.insert((reads){1,n,ans}),st.insert((rds){1,n,ans}),printf("%lld ",ans);
		for (int i=1;i<=n;++i)
		{
			x=read()^ans;
			auto it=st.lower_bound((rds){0,x,0});
			L=(*it).l,R=(*it).r,res=(*it).res,s.erase((reads){L,R,res}),st.erase(it);
			if (x-L<=R-x)
			{
				rst=0;
				for (int j=L;j<=x-1;++j) rst+=T.query(rt[j-1],1,n,a[j]+1,n)-T.query(rt[L-1],1,n,a[j]+1,n);
				if (L<=x-1) s.insert((reads){L,x-1,rst}),st.insert((rds){L,x-1,rst});
				for (int j=L;j<=x;++j) res-=T.query(rt[R],1,n,1,a[j]-1)-T.query(rt[j],1,n,1,a[j]-1);
				if (x+1<=R) s.insert((reads){x+1,R,res}),st.insert((rds){x+1,R,res});
			}
			else
			{
				for (int j=x;j<=R;++j) res-=T.query(rt[j-1],1,n,a[j]+1,n)-T.query(rt[L-1],1,n,a[j]+1,n);
				if (L<=x-1) s.insert((reads){L,x-1,res}),st.insert((rds){L,x-1,res});
				rst=0;
				for (int j=x+1;j<=R;++j) rst+=T.query(rt[j-1],1,n,a[j]+1,n)-T.query(rt[x],1,n,a[j]+1,n);
				if (x+1<=R) s.insert((reads){x+1,R,rst}),st.insert((rds){x+1,R,rst});
			}
			ans=(*s.begin()).res;
		    if (i<=n-2) printf("%lld ",ans);
			else if (i==n-1) printf("%lld\n",ans);
		}
	}
	return 0;
}