#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
const int N = 100005;
const int M = N * 20;
int ls[M], rs[M], size[M], cnt;
int n;
int add(int rt, int p, int l = 1, int r = n) {
	int x = ++ cnt;
	size[x] = size[rt] + 1;
	if(l == r) return x;
	int mid = (l + r) >> 1;
	if(p <= mid) {
		ls[x] = add(ls[rt], p, l, mid);
		rs[x] = rs[rt];
	} else {
		ls[x] = ls[rt];
		rs[x] = add(rs[rt], p, mid + 1, r);
	}
	return x;
}
int a[N];
int L[N], R[N];
int root[N];
std::multiset<ll> answers;

int bit[N];
ll ans[N];
using ll = long long;
void clear() {
	answers.clear();
	memset(L + 1, 0, n << 2);
	memset(R + 1, 0, n << 2);
	memset(a + 1, 0, n << 2);
	memset(root + 1, 0, n << 2);
	memset(bit + 1, 0, n << 2);
	memset(ans + 1, 0, n << 3);

	cnt = 0;
}

ll calc(int l, int r) {
	ll ans = 0;
	for(int i = l;i <= r;++i) {
		for(int x = a[i];x;x &= x - 1) {
			bit[x] += 1;
		}
		for(int x = a[i] + 1;x <= n;x += x & -x) {
			ans += bit[x];
		}
	}
	for(int i = l;i <= r;++i) 
		for(int x = a[i];x;x &= x - 1) 
			bit[x] = 0;
	return ans;
}
using IT = std::vector<int>::iterator;
ll calc(int rt0, int rt1, IT ql, IT qr, int l = 1, int r = n) {
	if(ql == qr) return 0;
	if(size[rt0] == size[rt1]) return 0;
	if(l == r) return (qr - lower_bound(ql, qr, l)) * (size[rt1] - size[rt0]);
	int mid = (l + r) >> 1;
	auto qm = upper_bound(ql, qr, mid);
	ll ret = 0;
	ret += calc(ls[rt0], ls[rt1], ql, qm, l, mid);
	ret += calc(rs[rt0], rs[rt1], qm, qr, mid + 1, r);
	ret += (size[ls[rt1]] - size[ls[rt0]]) * (qr - qm);
	return ret;
}
void set(int l, int r, ll v) {
	if(l > r) return ;
	R[l] = r, L[r] = l, ans[l] = v;
	answers.emplace(v);
}
void split(int l, int mid, int r) {
	ll all = ans[l];
	answers.erase(answers.find(all));
	int Llen = mid - l;
	int Rlen = r - mid;
	if(Llen > Rlen) {
		ll ra = calc(mid + 1, r);
		std::vector<int> x(a + mid + 1, a + r + 1);
		sort(x.begin(), x.end());
		auto pos = lower_bound(x.begin(), x.end(), a[mid]);
		all -= ra;
		all -= pos - x.begin();
		x.insert(pos, a[mid]);
		ll val = calc(root[l - 1], root[mid - 1], x.begin(), x.end());
		all -= ll(mid - l) * x.size() - val;
		set(l, mid - 1, all);
		set(mid + 1, r, ra);
	} else {
		ll la = calc(l, mid - 1);
		std::vector<int> x(a + l, a + mid);
		sort(x.begin(), x.end());
		auto pos = upper_bound(x.begin(), x.end(), a[mid]);
		all -= la;
		all -= x.end() - pos;
		x.insert(pos, a[mid]);
		for(int & p : x) -- p;
		ll val = calc(root[mid], root[r], x.begin(), x.end());
		all -= val;
		set(l, mid - 1, la);
		set(mid + 1, r, all);
	}
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T;

	#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	cin >> T;
	for(int i = 0;i < T;++i) {
		cin >> n;
		for(int i = 1;i <= n;++i) {
			cin >> a[i];
			root[i] = add(root[i - 1], a[i]);
		}
		set(1, n, calc(1, n));
		for(int i = 1;i <= n;++i) {
			cout << *answers.rbegin() << " \n"[i == n];
			ll p; cin >> p;
			p ^= *answers.rbegin();
			int le = -1, ri = -1;
			for(int x = 0;;++x) {
				if(p > x && R[p - x]) {
					le = p - x, ri = R[p - x];
					break;
				}
				if(p + x <= n && L[p + x]) {
					le = L[p + x], ri = p + x;
					break;
				}
			}
			split(le, p, ri);
		}
		clear();
	}
}