#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define sz(a) ((int) a.size())
#define vi vector<int>
#define ll long long
#define me(f, x) memset(f, x, sizeof(f))  
#define ull unsigned long long 
using namespace std;
const int N = 2e5 + 7, M = N * 20; 
int n, a[N];
int sum[M], ch[M][2], tot;
void add(int &x, int L, int R, int p) {
	++tot, ch[tot][0] = ch[x][0], ch[tot][1] = ch[x][1], sum[tot] = sum[x] + 1, x = tot;
	if(L == R) return ;
	int mid = (L + R) >> 1;
	p <= mid ? add(ch[x][0], L, mid, p) : add(ch[x][1], mid + 1, R, p);
} 
int query(int x, int L, int R, int l, int r) {
	if(l <= L && R <= r) return sum[x];
	int mid = (L + R) >> 1, ret = 0;
	if(l <= mid) ret += query(ch[x][0], L, mid, l, r);
	if(r > mid) ret += query(ch[x][1], mid + 1, R, l, r);
	return ret;
}
int hd[N];
ll fen[N];
inline ll get(int l, int r) {
	ll ans = 0;
	L(i, l + 1, r) 
		ans += 
		query(hd[i - 1], 0, n + 1, a[i] + 1, n + 1) - 
		query(hd[l - 1], 0, n + 1, a[i] + 1, n + 1);
	return ans;
}
void Main() {
	cin >> n;
	L(i, 1, n) {
		cin >> a[i], hd[i] = hd[i - 1], add(hd[i], 0, n + 1, a[i]);
	}
	set < int > st;
	st.insert(0), st.insert(n + 1);
	multiset < ll > ans;
	ans.insert(get(1, n));
	fen[1] = get(1, n);
	L(i, 1, n) {
		ll lst = *--ans.end();
		cout << lst << " \n"[i == n];
		ll u;
		cin >> u, u ^= lst;
		auto p = st.lower_bound(u);
		int r = *p - 1;
		int l = *--p + 1;
		st.insert(u);
		ans.erase(ans.lower_bound(fen[l]));
		ll cur = fen[l];
		if(u - l > r - u) {
			R(i, r, u) {
				cur -= 
				query(hd[i - 1], 0, n + 1, a[i] + 1, n + 1) - 
				query(hd[l - 1], 0, n + 1, a[i] + 1, n + 1);
			}
			fen[l] = cur;
			fen[u + 1] = get(u + 1, r);
		} else {
			L(i, l, u) {
				cur -= 
				query(hd[r], 0, n + 1, 0, a[i] - 1) - 
				query(hd[i], 0, n + 1, 0, a[i] - 1);
			}
			fen[l] = get(l, u - 1);
			fen[u + 1] = cur;
		}
		ans.insert(fen[l]);
		ans.insert(fen[u + 1]);
	}
	L(i, 1, tot) ch[i][0] = ch[i][1] = 0, sum[i] = 0;
	tot = 0;
}
int main() {
	ios :: sync_with_stdio (false);
	cin.tie (0); cout.tie (0);
	int t; cin >> t; 
	while(t--) Main();
	return 0;
}