#include <bits/stdc++.h>
using namespace std;

const int M = 30e5 + 200;
const int N = 2e5 + 200;

int n, a[N], rt[N];
long long now[N];

struct tree {
    int L[M], R[M];
    int t[M], sz = 0;

    void clear() {
        for (int i = 1; i <= sz; ++i) {
            L[i] = R[i] = t[i] = 0;
        }
        sz = 0;
    }
    
    inline int make() {
        return ++sz;
    }

    void build(int v, int tl = 1, int tr = n) {
        t[v] = 0;
        if (tl == tr) return;
        L[v] = make();
        R[v] = make();
        int tm = tl + tr >> 1;
        build(L[v], tl, tm);
        build(R[v], tm + 1, tr);
    }

    void upd(int pos, int v, int u, int tl = 1, int tr = n) {
        if (tl == tr) {
            t[v] = t[u] + 1;
            return;
        }
        int tm = tl + tr >> 1;
        L[v] = L[u];
        R[v] = R[u];
        if (pos <= tm) {
           L[v] = make();
           upd(pos, L[v], L[u], tl, tm);
        }
        else {
           R[v] = make();
           upd(pos, R[v], R[u], tm + 1, tr);
        }
        t[v] = t[L[v]] + t[R[v]];
    }

    int get(int l, int r, int lv, int rv, int tl = 1, int tr = n) {
        if (l <= tl && tr <= r)
            return t[rv] - t[lv];
        if (r < tl || tr < l)
            return 0;
        int tm = tl + tr >> 1;
        return get(l, r, L[lv], L[rv], tl, tm) + get(l, r, R[lv], R[rv], tm + 1, tr);
    }
} t;

void solve() {
    cin >> n;
    t.clear();
    rt[0] = t.make();
    t.build(rt[0]);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        rt[i] = t.make();
        t.upd(a[i], rt[i], rt[i - 1]);
    }
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans += t.get(a[i] + 1, n, rt[0], rt[i - 1]);
    }
    set<pair<int, int>> s;
    multiset<long long> vals;
    s.insert({1, n});
    now[1] = ans;
    vals.insert(ans);
    vals.insert(0);
    int alive[n + 1];
    for (int i = 1, p; i <= n; ++i) {
    alive[i] = 1;
    }
    for (int i = 1, p; i <= n; ++i) {
        cout << ans << " \n"[i == n];
        cin >> p;
        p ^= ans;
        if(p < 0 || p > n || alive[p] == 0) {
             cout << "SUKAAAA BLYAAT\n";
             exit(0);
        }
alive[p] = 0;
        if (i == n) break;
        auto it = prev(s.upper_bound({p, n + 1}));
        auto [l, r] = *it;
        s.erase(it);
        vals.erase(vals.find(now[l]));
        long long x = 0, y = 0, z = 0;
        if (p <= (l + r) / 2) {
            for (int j = l; j < p; ++j) {
                x += t.get(a[j] + 1, n, rt[l - 1], rt[j - 1]);
                y += t.get(1, a[j] - 1, rt[p], rt[r]);
            }
            z += t.get(1, a[p] - 1, rt[p], rt[r]);
            z += t.get(a[p] + 1, n, rt[l - 1], rt[p - 1]);
            if (p + 1 <= r) {
                now[p + 1] = now[l] - x - y - z;
                s.insert({p + 1, r});
                vals.insert(now[p + 1]);
            }
            if (p - 1 >= l) {
                s.insert({l, p - 1});
                now[l] = x;
                vals.insert(now[l]);
            }
        }
        else {
            for (int j = p + 1; j <= r; ++j) {
                x += t.get(a[j] + 1, n, rt[p], rt[j - 1]);
                y += t.get(a[j] + 1, n, rt[l - 1], rt[p - 1]);
            }
            z += t.get(1, a[p] - 1, rt[p], rt[r]);
            z += t.get(a[p] + 1, n, rt[l - 1], rt[p - 1]);
            if (p + 1 <= r) {
                s.insert({p + 1, r});
                now[p + 1] = x;
                vals.insert(now[p + 1]);
            }
            if (p - 1 >= l) {
                s.insert({l, p - 1});
                now[l] = now[l] - x - y - z;
                vals.insert(now[l]);
            }
        }
        ans = *vals.rbegin();
    }
}

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