#include <bits/stdc++.h>
using namespace std;
#define ll long long
set<array<ll, 3>> s;
multiset<ll> st;
int n, a[100010], rt[100010], cnt;
struct node {
	int sz, lson, rson;
} t[100010 * 40];
#define mid (l + r >> 1)
void change(int &now, int from, int x, int l = 1, int r = n) {
	t[now = ++cnt] = t[from], t[now].sz++;
	if (l == r) return;
	if (x <= mid) change(t[now].lson, t[from].lson, x, l, mid);
	else change(t[now].rson, t[from].rson, x, mid + 1, r);
}
int query(int now, int from, int x, int l = 1, int r = n) {
	if (x >= r) return t[now].sz - t[from].sz;
	if (x < l) return 0;
	if (x <= mid) return query(t[now].lson, t[from].lson, x, l, mid);
	return t[t[now].lson].sz - t[t[from].lson].sz + query(t[now].rson, t[from].rson, x, mid + 1, r);
}
ll calc(int l, int r) {
	ll res = 0;
	for (int i = l; i <= r; i++)
		res += query(rt[r], rt[i], a[i] - 1);
	return res;
}
void Solve(int test) {
	s.clear(), st.clear();
	cnt = 0;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i], change(rt[i], rt[i - 1], a[i]);
	s.insert({1, n, calc(1, n)}), st.insert(calc(1, n));
	for (int i = 1; i <= n; i++) {
		cout << *prev(st.end()) << " ";
		ll x;
		cin >> x, x ^= *prev(st.end());
		auto [l, r, p] = *prev(s.upper_bound({x, (int)1e9, 0}));
		s.erase({l, r, p}), st.erase(st.find(p));
		if (x <= (l + r) / 2) {
			ll pl = calc(l, x - 1);
			p -= pl;
			p -= x - l - query(rt[x - 1], rt[l - 1], a[x]);
			for (int i = l; i <= x; i++)
				p -= query(rt[r], rt[x], a[i] - 1);
			if (r > x) s.insert({x + 1, r, p}), st.insert(p);
			if (x > l) s.insert({l, x - 1, pl}), st.insert(pl);
		}
		else {
			ll pr = calc(x + 1, r);
			p -= pr;
			p -= query(rt[r], rt[x], a[x] - 1);
			for (int i = x; i <= r; i++)
				p -= x - l - query(rt[x - 1], rt[l - 1], a[i]);
			if (x > l) s.insert({l, x - 1, p}), st.insert(p);
			if (r > x) s.insert({x + 1, r, pr}), st.insert(pr);
		}
	}
	cout << endl;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	for (int i = 1; i <= T; i++) Solve(i);
	return 0;
}