#include <bits/stdc++.h>
using namespace std;
// 2023 OneWan
const int N = 1000005;
int n, a[N];
long long child[N << 5][2], sum[N << 5];
int tot;
int update(int L, int R, int old, int pos) {
    int now = ++tot;
    sum[now] = sum[old] + 1;
    child[now][0] = child[old][0];
    child[now][1] = child[old][1];
    if (L == R) {
        return now;
    }
    int mid = L + R >> 1;
    if (pos <= mid) child[now][0] = update(L, mid, child[now][0], pos);
    else child[now][1] = update(mid + 1, R, child[now][1], pos);
    return now;
}
int query(int L, int R, int old, int QL, int QR) {
    if (QL > QR) return 0;
    if (QL <= L && R <= QR) {
        return sum[old];
    }
    int mid = L + R >> 1;
    int res = 0;
    if (QL <= mid) {
        res += query(L, mid, child[old][0], QL, QR);
    }
    if (QR > mid) {
        res += query(mid + 1, R, child[old][1], QL, QR);
    }
    return res;
}
int root[N + 5];
struct Node {
	int L, R;
	long long res;
	Node() = default;
	Node(int L, int R, long long res) : L(L), R(R), res(res) {}
	friend bool operator<(const Node &lhs, const Node &rhs) {
		return lhs.L < rhs.L;
	}
};
void solve() {
    cin >> n;
    for (int i = 1 ; i <= n ; i++) {
        cin >> a[i];
    }
    tot = 0;
    for (int i = 1 ; i <= n ; i++) {
        root[i] = update(1, n, root[i - 1], a[i]);
    }
    multiset<long long> ans;
    set<Node> st;
    {
    	long long res = 0;
    	for (int i = 1 ; i <= n ; i++) {
    		res += query(1, n, root[i - 1], a[i] + 1, n);
    	}
    	ans.insert(res);
    	st.emplace(1, n, res);
    }
    ans.insert(0LL);
    ans.insert(0LL);
    ans.insert(0LL);
    ans.insert(0LL);
    ans.insert(0LL);
    for (int i = 1 ; i <= n ; i++) {
    	long long temp = *rbegin(ans);
    	cout << temp << " ";
    	long long x;
    	cin >> x;
    	if (i == n) break;
    	x ^= temp;
    	auto it = st.upper_bound(Node(x, x, 0));
    	if (it == begin(st)) continue;
    	it--;
    	auto [L, R, k] = *it;
    	st.erase(it);
    	ans.extract(k);
    	if (x - L <= R - x) {
    		long long res1 = 0, res2 = 0;
    		for (int j = L ; j < x ; j++) {
    			res1 += query(1, n, root[j - 1], a[j] + 1, n);
    			res1 -= query(1, n, root[L - 1], a[j] + 1, n);
    			res2 += query(1, n, root[R], 1, a[j] - 1);
    			res2 -= query(1, n, root[x], 1, a[j] - 1);
    		}
    		if (L <= x - 1) {
    			st.emplace(L, x - 1, res1);
    			ans.insert(res1);
    		}
    		if (x + 1 <= R) {
    			res2 = k - res1 - res2 - (query(1, n, root[R], 1, a[x] - 1) - query(1, n, root[x], 1, a[x] - 1)) - (query(1, n, root[x - 1], a[x] + 1, n) - query(1, n, root[L - 1], a[x] + 1, n));
    			st.emplace(x + 1, R, res2);
    			ans.insert(res2);
    		}
    	} else {
    		long long res1 = 0, res2 = 0;
    		for (int j = x + 1 ; j <= R ; j++) {
    			res1 += query(1, n, root[R], 1, a[j] - 1);
    			res1 -= query(1, n, root[j], 1, a[j] - 1);
    			res2 += query(1, n, root[x - 1], a[j] + 1, n);
    			res2 -= query(1, n, root[L - 1], a[j] + 1, n);
    		}
    		if (x + 1 <= R) {
    			st.emplace(x + 1, R, res1);
    			ans.insert(res1);
    		}
    		if (L <= x - 1) {
    			res2 = k - res1 - res2 - (query(1, n, root[x - 1], a[x] + 1, n) - query(1, n, root[L - 1], a[x] + 1, n)) - (query(1, n, root[R], 1, a[x] - 1) - query(1, n, root[x], 1, a[x] - 1));
    			st.emplace(L, x - 1, res2);
    			ans.insert(res2);
    		}
    	}
    }
    cout << "\n";
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
    	solve();
    }
    return 0;
}