#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, NN = 2e6 + 6;
int T, n, root[N], nodes, ls[NN], rs[NN], tree[NN], cnt, l[N], r[N], id[N], a[N]; ll inv[N], x;
void update(int &rt, int lrt, int l, int r, int x) {
	rt = ++ nodes;
	if (l == r) return void (tree[rt] = tree[lrt] + 1);
	int mid = l + r >> 1;
	if (x <= mid) rs[rt] = rs[lrt], update(ls[rt], ls[lrt], l, mid, x);
	else ls[rt] = ls[lrt], update(rs[rt], rs[lrt], mid+1, r, x);
	tree[rt] = tree[ls[rt]] + tree[rs[rt]];
}
int query(int rt, int l, int r, int x, int y) {
	if (! rt || x > y) return 0;
	if (l == x && r == y) return tree[rt];
	int mid = l + r >> 1;
	if (y <= mid) return query(ls[rt], l, mid, x, y);
	else if (x > mid) return query(rs[rt], mid+1, r, x, y);
	else return query(ls[rt], l, mid, x, mid) + query(rs[rt], mid+1, r, mid+1, y);
}
int main() {
	cin >> T;
	while (T --) {
		scanf ("%d", &n);
		for (int i=1; i<=n; i++)
			root[i] = 0; nodes = 0;
		cnt = 1, l[1] = 1, r[1] = n, inv[1] = 0, id[n+1] = 0;
		for (int i=1; i<=n; i++)
			scanf ("%d", &a[i]), update(root[i], root[i-1], 1, n, a[i]), 
			inv[1] += query(root[i-1], 1, n, a[i] + 1, n), id[i] = 1;
		priority_queue <ll> que, del;
		que. push(inv[1]);
		for (int i=1; i<=n; i++) {
			while (! del. empty() && del. top() == que. top())
				del. pop(), que. pop();
			printf (i < n ? "%lld " : "%lld\n", que. top());
			scanf ("%lld", &x), x ^= que. top();
			int y = id[x]; id[x] = 0, del. push(inv[y]);
			if (! id[x-1] && ! id[x+1]) continue;
			if (x - l[y] <= r[y] - x) {
				inv[y] -= query(root[x-1], 1, n, a[x] + 1, n) - query(root[l[y]-1], 1, n, a[x] + 1, n);
				for (int j=l[y]; j<=x; j++)
					inv[y] -= query(root[r[y]], 1, n, 1, a[j] - 1) - query(root[x], 1, n, 1, a[j] - 1);
				if (x > l[y]) {
					cnt ++, l[cnt] = l[y], r[cnt] = x - 1, inv[cnt] = 0;
					for (int j=l[cnt]; j<=r[cnt]; j++)
						id[j] = cnt;
					for (int j=l[cnt]+1; j<=r[cnt]; j++)
						inv[cnt] += query(root[j-1], 1, n, a[j] + 1, n) - query(root[l[cnt]-1], 1, n, a[j] + 1, n);
					inv[y] -= inv[cnt], que. push(inv[cnt]);
				} l[y] = x + 1, que. push(inv[y]);
			} else {
				inv[y] -= query(root[r[y]], 1, n, 1, a[x] - 1) - query(root[x], 1, n, 1, a[x] - 1);
				for (int j=x; j<=r[y]; j++)
					inv[y] -= query(root[x-1], 1, n, a[j] + 1, n) - query(root[l[y]-1], 1, n, a[j] + 1, n);
				if (x < r[y]) {
					cnt ++, l[cnt] = x + 1, r[cnt] = r[y], inv[cnt] = 0;
					for (int j=l[cnt]; j<=r[cnt]; j++)
						id[j] = cnt;
					for (int j=l[cnt]+1; j<=r[cnt]; j++)
						inv[cnt] += query(root[j-1], 1, n, a[j] + 1, n) - query(root[l[cnt]-1], 1, n, a[j] + 1, n);
					inv[y] -= inv[cnt], que. push(inv[cnt]);
				} r[y] = x - 1, que. push(inv[y]);
			}
/*			puts ("");
			for (int i=1; i<=n; i++)
				printf ("%d ", id[i]);
			puts ("");
			for (int i=1; i<=n; i++)
				if (id[i] && id[i] != id[i-1])
					printf ("%d : %lld\n", id[i], inv[id[i]]);
			puts (""); */
		}
	}
}