#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<set>
using namespace std;

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define debug(...)
#include<debug>
#else
#define debug(...)
#endif

constexpr int N = 1e5 + 10,  M = N<<5;

int t[N], tot;
int lch[M], rch[M], cnt[M];

void cpy(int from,int to) {
    lch[from]=lch[to];
    rch[from]=rch[to];
    cnt[from]=cnt[to];
}

void change(int &u,int old,int l,int r,int pos){
    u=++tot;
    cpy(u,old);
    if(l==r) {
        cnt[u]++;
        return;
    }
    int mid=(l+r)>>1;
    if(pos<=mid)
        change(lch[u],lch[u],l,mid,pos);
    else {
        change(rch[u], rch[u],mid+1,r,pos);
    }
    cnt[u]=cnt[lch[u]]+cnt[rch[u]];
}

int query(int s,int t,int l,int r,int ql,int qr) {
    // cerr<<l<<" "<<r<<endl;
    if(l==ql && r==qr) {
        return cnt[t]-cnt[s];
    }
    int mid=(l+r)>>1;
    if(qr<=mid)
        return query(lch[s],lch[t],l,mid,ql,qr);
    if(ql>mid)
        return query(rch[s],rch[t],mid+1,r,ql,qr);
    return query(lch[s],lch[t],l,mid,ql,mid)
        +query(rch[s], rch[t], mid+1, r, mid+1, qr);
}

int n,a[N];
int64_t p[N];
int64_t num[N];
int query(int s,int t0,int l,int r) {
    if(s>t0 || l>r) return 0;
    return query(t[s-1],t[t0],1,n,l,r);
}

void solve() {
    cin>>n;
    tot=0;
    int64_t inv=0;
    for(int i=1; i<=n; ++i) {
        cin>>a[i];
        change(t[i],t[i-1],1,n,a[i]);
        inv+=query(1,i-1,a[i]+1,n);
        // cerr<<inv<<"\n";
    }

    for(int i=1; i<=n; ++i) {
        cin>>p[i];
    }
    
    set<pair<int,int>> inter;
    set<pair<int64_t,int>> all;
    inter.emplace(1,n);
    all.emplace(inv,1), num[1]=inv;

    int64_t z=inv;
    for(int i=1; i<=n; ++i) {
        // cerr<<z<<endl;
        if(i>1) cout<<" ";
        cout<<z;
        p[i]^=z;
        debug(p[i]);

        auto it=--inter.upper_bound({p[i],1e9});
        auto [l,r]=*it;
        auto invNum=num[l];
        auto it1=all.lower_bound({invNum,l});
        debug(l,r,p[i]);

        all.erase(it1);
        inter.erase(it);

        if(p[i]-l<=r-p[i]) {
            int64_t num0=0,numlr=0;
            for(int j=l; j<p[i]; ++j) {
                num0+=query(j+1,p[i]-1,1,a[j]-1);
                numlr+=query(j+1,r,1,a[j]-1);
                debug(numlr);
            }
            numlr+=query(p[i]+1,r,1,a[p[i]]-1);
            debug(num0,numlr);


            if(l<p[i]) {
                all.emplace(num0,l), num[l]=num0;
                inter.emplace(l,p[i]-1);
            }
            if(p[i]<r) {
                all.emplace(invNum-numlr,p[i]+1), num[p[i]+1]=invNum-numlr;
                inter.emplace(p[i]+1,r);
            }
        }else {
            int64_t num0=0,numlr=0;
            for(int j=p[i]+1; j<=r; ++j) {
                num0+=query(p[i]+1,j-1,a[j]+1,n);
                numlr+=query(l,j-1,a[j]+1,n);
            }
            numlr+=query(l,p[i]-1,a[p[i]]+1,n);

            
            if(l<p[i]) {
                all.emplace(invNum-numlr,l), num[l]=invNum-numlr;
                inter.emplace(l,p[i]-1);
            }
            if(p[i]<r) {
                all.emplace(num0,p[i]+1), num[p[i]+1]=num0;
                inter.emplace(p[i]+1,r);
            }
        }
        if(i==n) break;
        z=all.rbegin()->first;
    }
    cout<<"\n";
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin>>T;
    while(T--) {
        solve();
    }
}