#include <bits/stdc++.h>

#include <bits/extc++.h> // pbds
using namespace __gnu_pbds;

using namespace std;

#define int long long

#define F(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0)

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

typedef tree<ii, null_type, less<ii>, rb_tree_tag,
             tree_order_statistics_node_update>
    ost;

vector<int> a;

ll inversions(int l, int r) {
  ost found;
  ll ans = 0;
  F(i, l, r) {
    ans += found.size() - found.order_of_key({a[i], i});
    found.insert({a[i], i});
  }

  return ans;
}

signed main() {
  IOS;
  cin.tie(0), cout.tie(0);

  int t, n;
  cin >> t;
  while (t--) {
    cin >> n;
    a.resize(n);
    F(i, 0, n) { cin >> a[i]; }
    vi z(n);
    F(i, 0, n) { cin >> z[i]; }

    map<ii, ll> values;
    set<pair<ll, ii>> sorted;
    set<int> removed({-1, n});

    values[{0, n}] = inversions(0, n);
    sorted.insert({values[{0, n}], {0, n}});
    ll ans = sorted.rbegin()->first;
    cout << ans << ' ';
    F(i, 0, n - 1) {
      z[i] ^= ans;

      int mid = z[i] - 1;
      auto it = removed.upper_bound(mid);
      int r = *it, l = *(--it) + 1;
      // cout << l << ' ' << mid << ' ' << r << endl;
      sorted.erase({values[{l, r}], {l, r}});
      values.erase({l, r});
      removed.insert(mid);

      ll val1 = inversions(l, mid), val2 = inversions(mid + 1, r);
      values[{l, mid}] = val1, sorted.insert({val1, {l, mid}});
      values[{mid + 1, r}] = val2, sorted.insert({val2, {mid + 1, r}});

      ans = sorted.rbegin()->first;
      cout << ans << ' ';
    }
    cout << '\n';
  }
}