#include<iostream>
#include<cstring>
#include<vector>
#include<set>
#include<array>
using namespace std;
using LL = long long;

using Info = int;

const int maxn = 1e5 + 5;
struct Node{
    Info info;
    int l, r;
}tr[maxn * 64];
int root[maxn];
int idx;

void modify_from(int &now, int pre, int l, int r, int x, int v){
    tr[now = ++idx] = tr[pre];
    if (l == r){
        tr[now].info += v;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid) modify_from(tr[now].l, tr[pre].l, l, mid, x, v);
    else modify_from(tr[now].r, tr[pre].r, mid + 1, r, x, v);
    tr[now].info = tr[tr[now].l].info + tr[tr[now].r].info;
}

Info query(int u, int l, int r, int L, int R){
    if (r < L || l > R){
        return Info();
    }
	if (l >= L && r <= R){
	 	return tr[u].info;
	}
	int mid = (l + r) / 2;
	return query(tr[u].l, l, mid, L, R) + query(tr[u].r, mid + 1, r, L, R);
}

Info query(int root1, int root2, int l, int r, int L, int R){
    if (r < L || l > R){
        return Info();
    }
    if (l >= L && r <= R){
        return tr[root2].info - tr[root1].info;
    }
    int mid = (l + r) / 2;
    return query(tr[root1].l, tr[root2].l, l, mid, L, R) + query(tr[root1].r, tr[root2].r, mid + 1, r, L, R);
}

struct Seg{
    int l, r;
    LL ans;
    bool operator<(const Seg &t) const{
        if (r != t.r) return r < t.r;
        return l < t.l;
    }
};

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];        
        for(int i = 0; i <= idx; i++)
            tr[i] = {0, 0, 0};
        idx = 0;
        for(int i = 1; i <= n; i++) root[i] = 0;
        for(int i = 1; i <= n; i++){
            modify_from(root[i], root[i - 1], 1, n, a[i], 1);
        }
        LL last = 0;
        for(int i = 1; i <= n; i++)
            last += query(root[i - 1], 1, n, a[i] + 1, n);
        set<Seg> s;
        multiset<LL> mx;
        mx.insert(last);
        s.insert({1, n, last});
        for(int i = 1; i <= n; i++){
            cout << last << " \n"[i == n];
            LL x;
            cin >> x;
            if (i == n) break;
            x ^= last;
            auto it = s.lower_bound({0, (int)x, 0});
            auto [l, r, invs] = *it;
            s.erase(it);
            mx.erase(mx.lower_bound(invs));
            invs -= query(root[l - 1], root[x - 1], 1, n, a[x] + 1, n);
            invs -= query(root[x], root[r], 1, n, 1, a[x] - 1);
            if (x - l <= r - x){
                LL invs1 = 0, invs2 = 0;
                for(int i = l; i < x; i++){
                    invs1 += query(root[i], root[x - 1], 1, n, 1, a[i] - 1);
                    invs2 += query(root[x], root[r], 1, n, 1, a[i] - 1);
                }
                invs2 = invs - invs2 - invs1;
                if (l <= x - 1){
                    s.insert({l, (int)x - 1, invs1});
                    mx.insert(invs1);
                }
                if (x + 1 <= r){
                    s.insert({(int)x + 1, r, invs2});
                    mx.insert(invs2);
                }
            }
            else{
                LL invs1 = 0, invs2 = 0;
                for(int i = x + 1; i <= r; i++){
                    invs2 += query(root[x], root[i - 1], 1, n, a[i] + 1, n);
                    invs1 += query(root[l - 1], root[x - 1], 1, n, a[i] + 1, n);
                }
                invs1 = invs - invs1 - invs2;
                if (l <= x - 1){
                    s.insert({l, (int)x - 1, invs1});
                    mx.insert(invs1);
                }
                if (x + 1 <= r){
                    s.insert({(int)x + 1, r, invs2});
                    mx.insert(invs2);
                }
            }
            last = *mx.rbegin();
        }
    }

}