#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct node {
    int l{-1}, r{-1};
    int sum{0};
};

vector<node> all;

int add() {
    all.emplace_back();
    return all.size() - 1;
}

int add(node a) {
    all.push_back(a);
    return all.size() - 1;
}

int build(int l, int r) {
    if (l + 1 == r) {
        return add();
    }
    int m = (r + l) / 2;
    int id = add();
    all[id].l = build(l, m);
    all[id].r = build(m, r);
    return id;
}

int upd(int v, int l, int r, int k, int x) {
    if (l + 1 == r) {
        int id = add(all[v]);
        all[id].sum += x;
        return id;
    }
    int m = (r + l) / 2;
    int id = add(all[v]);
    if (k < m) {
        all[id].l = upd(all[v].l, l, m, k, x);
    } else {
        all[id].r = upd(all[v].r, m, r, k, x);
    }
    all[id].sum = all[all[id].l].sum + all[all[id].r].sum;
    return id;
}

int get(int v1, int v2, int l, int r, int lq, int rq) {
    if (l >= rq || lq >= r)return 0;
    if (l >= lq && r <= rq) { return all[v1].sum - all[v2].sum; }
    int m = (r + l) / 2;
    return get(all[v1].l, all[v2].l, l, m, lq, rq) + get(all[v1].r, all[v2].r, m, r, lq, rq);
}

using range = array<ll, 3>;

void solve() {
    all.clear();
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &i: a) {
        cin >> i;
        --i;
    }
    vector<int> versions(n + 1);
    versions.back() = build(0, n);
    ll score{0};
    for (int i = n - 1; ~i; --i) {
        versions[i] = upd(versions[i + 1], 0, n, a[i], 1);
        score += get(versions[i], versions[n], 0, n, 0, a[i]);
    }
    multiset<ll> best;
    set<range> s;
    s.insert({0, n, score});
    best.insert(score);
    for (ll i = 0; i < n; ++i) {
        if (i)cout << " ";
        ll last = *best.rbegin();
        cout << last;
        ll pos;
        cin >> pos;
        pos ^= last;
        --pos;
        auto it = s.lower_bound(range{pos, n + 1, n});
        assert(it != s.begin());
        --it;
        auto [l, r, score] = *it;
        s.erase(it);
        best.erase(best.find(score));
        if (pos - l < r - pos) {
            range left = {l, pos, 0};
            range right = {pos + 1, r, score};
            for (int j = l; j <= pos; ++j) {
                if (j != pos){
                    left[2] += (j - l) - get(versions[l], versions[j], 0, n, 0, a[j] + 1);
                }
                right[2] -= get(versions[pos], versions[r], 0, n, 0, a[j]);
            }
            right[2] -= left[2];
            s.insert(left);
            s.insert(right);
            best.insert(left[2]);
            best.insert(right[2]);
        } else {
            range left = {l, pos, score};
            range right = {pos + 1, r, 0};
            for (int j = pos; j < r; ++j) {
                if (j != pos) {
                    right[2] += (j - pos - 1) - get(versions[pos + 1], versions[j], 0, n, 0, a[j] + 1);
                }
                left[2] -= (pos + 1 - l) - get(versions[l], versions[pos + 1], 0, n, 0, a[j] + 1);
            }
            left[2] -= right[2];
            s.insert(left);
            s.insert(right);
            best.insert(left[2]);
            best.insert(right[2]);
        }
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(false);

    int t;
    cin >> t;
    for(int i = 0;i <t;++i){
        if(i)cout << "\n";solve();
    }
}