#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
#define wln putchar('\n')
template<class T1,class T2> void chkmin(T1 &x,T2 y){if(y<x)x=y;}
template<class T1,class T2> void chkmax(T1 &x,T2 y){if(y>x)x=y;}
#define maxn 100005

int T;
int n;
struct node{
    int val, lc, rc;
}t[maxn * 40];
int e = 0;

int a[maxn];
int rt[maxn];
ll ans = 0;

typedef pair<int, int> pii;
typedef pair<pii, ll> piii;

set<piii> st;
multiset<ll> as;

void init()
{
    e = 0;
    ans = 0;
    st.clear();
    as.clear();
}
int newnode()
{
    e++;
    t[e] = {0, 0, 0};
    return e;
}
void make(int pre, int now, int v, int l, int r)
{
    if(l == r) {
        t[now].val = t[pre].val + 1;
        return ;
    }
    int mid = (l + r) / 2;
    if(v <= mid) {
        t[now].rc = t[pre].rc;
        t[now].lc = newnode();
        ans += t[t[now].rc].val;
        make(t[pre].lc, t[now].lc, v, l, mid);
    }
    else {
        t[now].lc = t[pre].lc;
        t[now].rc = newnode();
        make(t[pre].rc, t[now].rc, v, mid + 1, r);
    }
    t[now].val = t[t[now].lc].val + t[t[now].rc].val;
}
int rnk(int pre, int now, int v, int l, int r)
{
    if(l == r) return 0;
    int mid = (l + r) / 2;
    if(v <= mid) return rnk(t[pre].lc, t[now].lc, v, l, mid);
    return t[t[now].lc].val - t[t[pre].lc].val + rnk(t[pre].rc, t[now].rc, v, mid + 1, r);
}
int bg(int pre, int now, int v, int l, int r)
{
    if(l == r) return 0;
    int mid = (l + r) / 2;
    if(v <= mid) return t[t[now].rc].val - t[t[pre].rc].val + bg(t[pre].lc, t[now].lc, v, l, mid);
    return bg(t[pre].rc, t[now].rc, v, mid + 1, r);
}
void Main()
{
    init();
    scanf("%d", &n);
    For(i, 1, n) scanf("%d", &a[i]);
    For(i, 1, n) {
        rt[i] = newnode();
        make(rt[i - 1], rt[i], a[i], 1, n);
    }
    int p;
    as.insert(ans);
    st.insert({{1, n}, ans});
    For(i, 1, n) {
        auto it = as.end();
        it--;
        ans = *it;
        //as.erase(it);
        printf("%lld ", ans);
        scanf("%d", &p);
        p ^= ans;
        auto itt = st.lower_bound({{p, n + 1}, 0});
        itt--;
        int l = itt -> first.first, r = itt -> first.second;
        ll tmp = itt ->second;
        st.erase(itt);
        it = as.find(tmp);
        as.erase(it);
        ll l0 = 0, r0 = 0, p0 = 0;
        if(p - l <= r - p) {
            For(i, l + 1, p - 1) {
                l0 += bg(rt[l - 1], rt[i], a[i], 1, n);
            }   
            For(i, l, p) {
                r0 += rnk(rt[p], rt[r], a[i], 1, n);
            }
            p0 = bg(rt[l - 1], rt[p], a[p], 1, n);
            r0 = tmp - l0 - p0 - r0;
        }
        else {
            For(i, p + 1, r) {
                r0 += bg(rt[p], rt[i], a[i], 1, n);
            }
            For(i, p, r) {
                l0 += bg(rt[l - 1], rt[p - 1], a[i], 1, n);
            }
            p0 = rnk(rt[p], rt[r], a[p], 1, n);
            l0 = tmp - r0 - p0 - l0;
        }
        if(p - 1 >= l)
            st.insert({{l, p - 1}, l0}), as.insert(l0);
        if(r >= p + 1)
            st.insert({{p + 1, r}, r0}), as.insert(r0);
    }
    printf("\n");
}
int main()
{
    scanf("%d", &T);
    while(T--) Main();
    return 0;
}
/*
3
5
4 3 1 1 1
5 4 5 3 1
10
9 7 1 4 7 8 5 7 4 8
21 8 15 5 9 2 4 5 10 6
15
4 8 8 1 12 1 10 14 7 14 2 9 13 10 3
37 19 23 15 7 2 10 15 2 13 4 5 8 7 10


1
15
4 8 8 1 12 1 10 14 7 14 2 9 13 10 3
37 19 23 15 7 2 10 15 2 13 4 5 8 7 10
*/