#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

struct node {
  int l, r, x;
};

struct interval {
  int l, r;
  ll x;

  bool operator < (const interval &aux) const {
    if (l != aux.l)
      return l < aux.l;
    return r < aux.r;
  }
};

const int NMAX = 1e5 + 1;

int n, nr;
node arb[31 * NMAX];
int a[NMAX];

void build(int nod = 0, int st = 1, int dr = n) {
  arb[nod].x = 0;

  if (st == dr)
    return;

  arb[nod].l = ++nr; 
  arb[nod].r = ++nr; 
  int mij = (st + dr) / 2;

  build(arb[nod].l, st, mij);
  build(arb[nod].r, mij + 1, dr);
}

int update(int p, int nod, int st = 1, int dr = n) {
  if (st == dr) {
    arb[++nr] = arb[nod];
    arb[nr].x += 1;
    return nr;
  }

  int mij = (st + dr) / 2;
  int now = ++nr;
  arb[now] = arb[nod];
  arb[now].x += 1;
  if (p <= mij) {
    arb[now].l = update(p, arb[now].l, st, mij);
  } else {
    arb[now].r = update(p, arb[now].r, mij + 1, dr);
  }

  return now;
}

int query(int x, int y, int n1, int n2, int st = 1, int dr = n) {
  if (x <= st && dr <= y)
    return arb[n2].x - arb[n1].x;

  int mij = (st + dr) / 2;
  int sum = 0;
  if (x <= mij)
    sum += query(x, y, arb[n1].l, arb[n2].l, st, mij);
  if (mij + 1 <= y)
    sum += query(x, y, arb[n1].r, arb[n2].r, mij + 1, dr);

  return sum;
}

void solve() {
  cin >> n;
  nr = 0;

  vector<vector<int>> v(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    v[a[i]].push_back(i);
  }

  vector<int> root = {0};
  build();
  for (int i = 1; i <= n; ++i) {
    int new_root = root[i - 1];
    for (auto p : v[i])
      new_root = update(p, new_root);
    root.push_back(new_root);
  }

  ll cnt = 0;
  for (int i = 1; i < n; ++i)
    cnt += query(i + 1, n, root[0], root[a[i] - 1]);

  set<interval> s;
  multiset<ll> val;
  s.insert({1, n, cnt});
  val.insert(cnt);
  for (int j = 1; j <= n; ++j) {
    ll ans = *val.rbegin();
    cout << ans << " ";
    ll y;
    cin >> y;
    int x = y ^ ans;
    if (j == n)
      break;

    auto it = s.lower_bound({x, 0, 0});
    if (it == s.end() || it->l > x)
      it = prev(it);

    int l1 = it->l, r1 = x - 1;
    int l2 = x + 1, r2 = it->r;

    ll x1, x2;
    if (r1 - l1 < r2 - l2) {
      x1 = 0, x2 = it->x;
      for (int i = l1; i <= r1; ++i) {
        if (i + 1 <= r1)
          x1 += query(i + 1, r1, root[0], root[a[i] - 1]);
        x2 -= query(i + 1, r2, root[0], root[a[i] - 1]);
      }

      if (x + 1 <= r2)
        x2 -= query(x + 1, r2, root[0], root[a[x] - 1]);
    } else {
      x1 = it->x, x2 = 0;
      for (int i = l2; i <= r2; ++i) {
        if (i + 1 <= r2) {
          int aux = query(i + 1, r2, root[0], root[a[i] - 1]);
          x2 += aux;
          x1 -= aux;
        }
        if (a[i] < n) {
          int aux = query(l1, x, root[a[i]], root[n]);
          //cout << l1 << " " << x << " " << aux << endl;
          x1 -= aux;
        }
      }

      if (a[x] < n && l1 <= x - 1)
        x1 -= query(l1, x - 1, root[a[x]], root[n]);
      //cout << x1 << " " << x2 << " " << l2 << " " << r2 << endl;
    }

    val.erase(val.find(it->x));
    val.insert(x1);
    val.insert(x2);
    s.erase(it);
    if (l1 <= r1)
      s.insert({l1, r1, x1});
    if (l2 <= r2)
      s.insert({l2, r2, x2});

  }
  cout << "\n";
}

int main() {
#ifdef HOME
  ifstream cin("input.in");
  ofstream cout("output.out");
#endif
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  
  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}