#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5+9;
int root[N], n, a[N];
map<int, int> rev;// rev[a] stands for the rev of range beginning at id [a + 1] 
multiset<int> s;
struct ChairmanTree {
	int sum[N << 5], ch[N << 5][2], tot = 0;
	int newnode() {
		tot++;
		sum[tot] = 0; ch[tot][0] = ch[tot][1] = 0;
		return tot;
	}
	
	void add(int id, int l, int r, int old, int pos) {
		sum[id] = sum[old]; ch[id][0] = ch[old][0]; ch[id][1] = ch[old][1];
		int mid = (l + r) >> 1;
		if (l == r) {sum[id]++; return;}
		if (pos <= mid) add(ch[id][0] = newnode(), l, mid, ch[old][0], pos);
		else add(ch[id][1] = newnode(), mid + 1, r, ch[old][1], pos);
		sum[id] = sum[ch[id][0]] + sum[ch[id][1]];
	}
	
	int query(int id, int l, int r, int cl, int cr) {
		if (cl > cr) return 0;
		if (cl <= l && r <= cr) return sum[id];
		int mid = (l + r) >> 1, res = 0;
		if (cl <= mid) res += query(ch[id][0], l, mid, cl, cr);
		if (mid < cr) res += query(ch[id][1], mid + 1, r, cl, cr);
		return res; 
	}
} T;

void split(int l, int r, int x) {
	int old = rev[l]; s.erase(s.find(old));
	int ax = T.query(root[r - 1], 1, n, 1, a[x] - 1) - T.query(root[x], 1, n, 1, a[x] - 1)
				 + T.query(root[x - 1], 1, n, a[x] + 1, n) - T.query(root[l], 1, n, a[x] + 1, n);
	if (x - l < r - x) {
		int one = 0, two = ax;//one is the rev of left; two is right
		for (int i = l + 1; i < x; i++) {
			one += T.query(root[i - 1], 1, n, a[i] + 1, n) - T.query(root[l], 1, n, a[i] + 1, n);
			two += T.query(root[r - 1], 1, n, 1, a[i] - 1) - T.query(root[x], 1, n, 1, a[i] - 1);
		}
		
		rev[l] = one; rev[x] = old - one - two; s.insert(rev[l]); s.insert(rev[x]);
	}
	
	else {
		int one = 0, two = ax;//one is the rev of right; two is left
		for (int i = x + 1; i < r; i++) {
			one += T.query(root[i - 1], 1, n, a[i] + 1, n) - T.query(root[x], 1, n, a[i] + 1, n);
			two += T.query(root[x - 1], 1, n, a[i] + 1, n) - T.query(root[l], 1, n, a[i] + 1, n);
		}
		
		rev[l] = old - one - two; rev[x] = one; s.insert(rev[l]); s.insert(rev[x]);
	}
}

void solve() {
	T.tot = 0;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) T.add(root[i] = T.newnode(), 1, n, root[i - 1], a[i]);
	int ori = 0;
	for (int i = 1; i <= n; i++) ori += T.query(root[i - 1], 1, n, a[i] + 1, n);
	rev.clear(); rev[0] = ori; rev[n + 1] = 0;
	s.clear(); s.insert(ori); s.insert(0);
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans = *prev(s.end()); cout << ans;
		if (i == n) cout << "\n";
		else cout << " ";
		int x; cin >> x;
		x ^= ans;
		auto it = prev(rev.lower_bound(x));
		split(it->first, next(it)->first, x);
	}
}

signed main() {
	//freopen("G.in", "r", stdin);
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int T; cin >> T;
	while (T--) solve();
	return 0;
}