#include<bits/stdc++.h>
using namespace std;

const int MAXN = 100'005, LOGN = 18;
int segcnt = 0;
struct segment {
    int l, r, lid, rid, sum;
} segs[2*(2*MAXN+2*MAXN*LOGN)];
int build(int l, int r) { //$\mathcal{O}(n)$
    if(l > r) return -1;
    int id = segcnt++;
    segs[id].l = l;
    segs[id].r = r;
    if(l == r)
        segs[id].lid = -1, segs[id].rid = -1;
    else {
        int m = (l + r) / 2;
        segs[id].lid = build(l, m);
        segs[id].rid = build(m + 1, r);
    }
    segs[id].sum = 0; //initial array has only zeroes
    return id; //return the id of the new root
}
int update(int idx, int v, int id) { //$\mathcal{O}(\log{n})$
    if(id == -1) return -1;
    if(idx < segs[id].l || idx > segs[id].r)
        return id;
    int nid = segcnt++;
    segs[nid].l = segs[id].l;
    segs[nid].r = segs[id].r;
    segs[nid].lid = update(idx, v, segs[id].lid);
    segs[nid].rid = update(idx, v, segs[id].rid);
    segs[nid].sum = segs[id].sum + v; // point update
    return nid; //return the id of the new root
}
int query(int id, int l, int r) { //$\mathcal{O}(\log{n})$
    if(r < segs[id].l || segs[id].r < l) return 0;
    if(l <= segs[id].l && segs[id].r <= r)
        return segs[id].sum;
    return query(segs[id].lid, l, r) +
    query(segs[id].rid, l, r); // sum query
}

int n;
int id[MAXN];

int f(int l,int r,int low,int up){//num of elem low<=x<=up in [l,r]
    if(l>r || low>up)return 0;
    return query(id[r],low,up)-query(id[l-1],low,up);
}

void solve(int t){
    cin>>n;
    
    segcnt = 0;
    id[0]=build(1,n);
    
    vector<int> a(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        id[i]=update(a[i],1,id[i-1]);
    }
    
    multiset<long long> pq;
    long long st=0;
    for(int i=1;i<n;i++){
        st+=f(i+1,n,1,a[i]-1);
        //cout<<f(i+1,n,1,a[i]-1)<<" ecco\n";
    }
    set<pair<int,long long>> block = {{0,st},{n+1,0}};
    pq.insert(st);
    cout<<st<<" ";
    
    long long last=st;
    for(int i=0;i<n;i++){
        long long p;
        cin>>p;
        p^=last;
        if(i+1==n)break;
        
        auto itr = block.lower_bound({p,0});
        auto itl = itr;
        itl--;
        
        long long val = itl->second;
        int l1=itl->first+1;
        int r1=p-1;
        int l2=p+1;
        int r2=itr->first-1;
        
        long long v1=0,v2=0,oth=0;
        
        if(r1-l1<r2-l2){
            
            for(int i=l1;i<=r1;i++){
                v1+=f(i+1,r1,1,a[i]-1);
                oth+=f(l2-1,r2,1,a[i]-1);
            }
            oth+=f(l2,r2,1,a[l2-1]-1);
            
            v2 = val-v1-oth;
        }else{
            
            for(int i=l2;i<=r2;i++){
                v2+=f(i+1,r2,1,a[i]-1);
                oth+=f(l1,r1+1,a[i]+1,n);
            }
            oth+=f(l1,r1,a[l2-1]+1,n);
            
            v1 = val-v2-oth;
        }
        
        pq.erase(pq.find(val));
        pq.insert(v1);
        pq.insert(v2);
        
        block.erase(itl);
        block.insert({l1-1,v1});
        block.insert({l2-1,v2});
        
        cout<<*pq.rbegin()<<" ";
        last=*pq.rbegin();
    }
    cout<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}