#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define int long long
using namespace std;
const int _=1e5+7;
int n,a[_];
namespace TREE {
    #define ls(x) e[x].l
    #define rs(x) e[x].r
    struct node {int l,r,siz;}e[_*22];
    int cnt;
    void insert(int l,int r,int L,int x,int &y) {
        e[y=++cnt]=e[x];
        e[y].siz++;
        if(l==r) return;
        int mid=(l+r)>>1;
        if(L<=mid) insert(l,mid,L,ls(x),ls(y));
        else insert(mid+1,r,L,rs(x),rs(y));
    }
    int query(int l,int r,int L,int R,int x,int y) {
        if(L>R) return 0;
        if(L<=l&&r<=R) return e[y].siz-e[x].siz;
        int mid=(l+r)>>1,ans=0;
        if(L<=mid) ans+=query(l,mid,L,R,ls(x),ls(y));
        if(R>mid) ans+=query(mid+1,r,L,R,rs(x),rs(y));
        return ans;
    }
}
void solve() {
    TREE::cnt=0;
    cin>>n;
    vector<int> rt(n+1);
    FOR(i,1,n) {
        cin>>a[i];
        TREE::insert(1,n,a[i],rt[i-1],rt[i]);
    }
    int last_ans=0;
    FOR(i,1,n) last_ans+=TREE::query(1,n,1,a[i]-1,rt[i],rt[n]);
    multiset<int> S;
    multiset<array<int,3>> T;
    S.insert(last_ans);
    T.insert({n,1,last_ans});
    FOR(TTT,1,n) {
        last_ans=(*S.rbegin());
        cout<<last_ans<<" \n"[TTT==n];

        int x;
        cin>>x;
        x=x^last_ans;
        
        auto [r,l,tot]=*T.lower_bound({x,0,0});


        T.erase(T.lower_bound({x,0,0}));
        S.erase(S.find(tot));
        if(l<=x-1) tot-=TREE::query(1,n,a[x]+1,n,rt[l-1],rt[x-1]);
        if(x+1<=r) tot-=TREE::query(1,n,1,a[x]-1,rt[x],rt[r]);

        if(r-x < x-l)  {
            int res=0;
            FOR(i,x+1,r) {
                res+=TREE::query(1,n,1,a[i]-1,rt[i],rt[r]);
                if(l<=x-1) tot-=TREE::query(1,n,a[i]+1,n,rt[l-1],rt[x-1]);
            }

            if(l<=x-1) S.insert(tot-res),T.insert({x-1,l,tot-res});
            if(x+1<=r) S.insert(res),T.insert({r,x+1,res});
        } else {
            int res=0;
            FOR(i,l,x-1) {
                res+=TREE::query(1,n,1,a[i]-1,rt[i],rt[x-1]);
                if(x+1<=r) tot-=TREE::query(1,n,1,a[i]-1,rt[x],rt[r]);
            }

            if(l<=x-1) S.insert(res),T.insert({x-1,l,res});
            if(x+1<=r) S.insert(tot-res),T.insert({r,x+1,tot-res});
        }

    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    while(T--) {
        solve();
    }   
    return 0;
}