#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
vector<int> seg[N];

void build(int l, int r, int k, vector<int>& a) {
	if (l == r) {
		seg[k] = {a[l]};
		return;
	}
	int m = (l + r) / 2;
	build(l, m, k * 2, a);
	build(m + 1, r, k * 2 + 1, a);
	seg[k].clear();
	merge(all(seg[k * 2]), all(seg[k * 2 + 1]), back_inserter(seg[k]));
}

int count_smaller(int l, int r, int k, int x, int y, int v) {
	if (r < x || y < l || x > y) return 0;
	if (x <= l && r <= y)
		return lower_bound(all(seg[k]), v) - seg[k].begin();
	int m = (l + r) / 2;
	return count_smaller(l, m, k * 2, x, y, v) + count_smaller(m + 1, r, k * 2 + 1, x, y, v);
}

void solve() {
	int n; cin >> n;
	vector<int> a(n);
	vector<vector<int>> pos(n);
	for (int i = 0; i < n; i++)
		cin >> a[i], a[i]--, pos[a[i]].push_back(i);
	ll last = 0;
	vector<int> fen(n + 5);
	auto upd = [&](int i) {
		for (++i; i < n + 5; i += i & -i)
			fen[i]++;
	};
	auto qry = [&](int i) {
		ll r = 0;
		for (++i; i > 0; i -= i & -i)
			r += fen[i];
		return r;
	};
	for (int i = n - 1; i >= 0; i--) {
		for (int j = sz(pos[i]) - 1; j >= 0; j--) {
			last += qry(pos[i][j]);
			upd(pos[i][j]);
		}
	}
	build(0, n - 1, 1, a);
	set<int> bad;
	bad.insert(-1);
	bad.insert(n);
	multiset<int> tmp;
	vector<ll> inv(n + 1);
	inv[0] = last;
	tmp.insert(last);
	for (int i = 0; i < n; i++) {
		last = *tmp.rbegin();
		cout << last << " \n"[i + 1 == n];
		ll p; cin >> p;
		p ^= last;
		p--;
		auto it = bad.lower_bound(p);
		int l = *prev(it) + 1, r = *it - 1;
		tmp.erase(tmp.find(inv[l]));
		ll tot = inv[l];
		if (p - l < r - p) {
			inv[l] = 0;
			for (int j = l; j <= p; j++) {
				tot -= count_smaller(0, n - 1, 1, p, r, a[j]);
				if (j < p)
					inv[l] += count_smaller(0, n - 1, 1, j + 1, p - 1, a[j]);
			}
			inv[p + 1] = tot - inv[l];
		} else {
			for (int j = p; j <= r; j++) {
				tot -= p - l + 1 - count_smaller(0, n - 1, 1, l, p, a[j] + 1);
				if (j > p)
					inv[p + 1] += count_smaller(0, n - 1, 1, j + 1, r, a[j]);
			}
			inv[l] = tot - inv[p + 1];
		}
		tmp.insert(inv[l]);
		tmp.insert(inv[p + 1]);
		bad.insert(p);
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int t; cin >> t; while (t--) solve();
}