#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int cnt = sizeof...(T);
  (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L)
    cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

template <typename T>
using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

int64_t calc(vector<int> a) {
  int64_t r = 0;
  ordered_set<pair<int, int>> s;
  for (int i = 0; i < int(a.size()); ++i) {
    r += s.order_of_key({-a[i], -1});
    s.insert({-a[i], i});
  }
  return r;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int &ai : a)
      cin >> ai;
    auto sub = [&a](int l, int r) {
      vector<int> v;
      for (int i = l; i < r; ++i)
        v.push_back(a[i]);
      return v;
    };

    priority_queue<pair<int64_t, int>> pq;
    vector<int> idx(n);
    int ctr = 0;;
    vector<pair<int, int>> lr(n);
    vector<pair<int64_t, ordered_set<pair<int, int>>>> v(n);
    auto build = [&](int l, int r) {
      lr[ctr] = {l, r};
      ordered_set<pair<int, int>> s;
      for (int i = l; i < r; ++i) {
        idx[i] = ctr;
        s.insert({a[i], i});
      }
      v[ctr] = {calc(sub(l, r)), s};
      pq.emplace(v[ctr].first, ctr);
      ctr += 1;
    };
    auto gao = [&](int p) {
      int o = idx[p];
      auto [l, r] = lr[o];
      // [l, p)
      // [p + 1, r)
      if (p - l < r - (p + 1)) {
        lr[o] = {p + 1, r};
        if (l != p) {
          build(l, p);
          v[o].first -= v[idx[l]].first;
          v[o].first -= v[idx[l]].second.size() - v[idx[l]].second.order_of_key({a[p], n});
        }
        for (int i = l; i <= p; ++i)
          v[o].second.erase({a[i], i});
        for (int i = l; i <= p; ++i)
          v[o].first -= v[o].second.order_of_key({a[i], -1});
        pq.emplace(v[o].first, o);
      } else {
        lr[o] = {l, p};
        if (p + 1 != r) {
          build(p + 1, r);
          v[o].first -= v[idx[p + 1]].first;
          v[o].first -= v[idx[p + 1]].second.order_of_key({a[p], -1});
        }
        for (int i = p; i < r; ++i)
          v[o].second.erase({a[i], i});
        for (int i = p; i < r; ++i)
          v[o].first -= v[o].second.size() - v[o].second.order_of_key({a[i], n});
        pq.emplace(v[o].first, o);
      }
    };
   
    build(0, n); 
    for (int i = 0; i < n; ++i) {
      while (not pq.empty()) {
        if (v[pq.top().second].first != pq.top().first)
          pq.pop();
        else
          break;
      }
      cout << pq.top().first << " \n"[i + 1 == n];
      int64_t p;
      cin >> p;
      p ^= pq.top().first;
      gao(p - 1);
    }
  }
  return 0;
}