#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

const int N = 100010;
const int M = N * 30;

struct fwt {
  ll t[N];
  int n;
  void upd(int x, int v) {
    while (x <= n) t[x] += v, x += x & (-x);
  }
  ll qry(int x) {
    ll res = 0;
    while (x) res += t[x], x -= x & (-x);
    return res;
  }
} fwt;

int n, a[N], rt[N], ls[M], rs[M], tot;
ll t[M];
ll p[N];
set<pii> s;
multiset<ll> S;
map<pii, ll> mp;

ll inv(int l, int r) {
  ll res = 0;
  per (i, r, l) res += fwt.qry(a[i] - 1), fwt.upd(a[i], 1);
  rep (i, l, r) fwt.upd(a[i], -1);
  return res;
}

#define mid ((l + r) >> 1)

void upd(int &p, int q, int l, int r, int x) {
  p = ++tot, t[p] = t[q] + 1, ls[p] = ls[q], rs[p] = rs[q];
  if (l == r) return;
  if (x <= mid) upd(ls[p], ls[q], l, mid, x);
  else upd(rs[p], rs[q], mid + 1, r, x);
}

ll qry(int p, int l, int r, int x, int y) {
  if (!p || x > y) return 0;
  if (l == x && r == y) return t[p];
  if (y <= mid) return qry(ls[p], l, mid, x, y);
  else if (x > mid) return qry(rs[p], mid + 1, r, x, y);
  else return qry(ls[p], l, mid, x, mid) + qry(rs[p], mid + 1, r, mid + 1, y);
}

#undef mid

void work() {
  cin >> n;
  rep (i, 1, n) cin >> a[i];
  rep (i, 1, n) cin >> p[i];
  s.clear(), s.insert(pii(1, n));
  tot = 0, fwt.n = n;
  rep (i, 1, n) upd(rt[i], rt[i - 1], 1, n, a[i]);
  ll res = inv(1, n);
  S.clear(), S.insert(res);
  mp.clear(), mp[pii(1, n)] = res;
  rep (i, 1, n) {
    res = *prev(S.end());
    cout << res, p[i] ^= res;
    if(i != n) cout << " ";
    auto it = prev(s.upper_bound(pii(p[i], 1e9)));
    int l = it -> fi, r = it -> se;
    s.erase(it);
    ll lst = mp[pii(l, r)];
    S.erase(S.find(lst));
    lst -= qry(rt[r], 1, n, 1, a[p[i]] - 1) - qry(rt[p[i]], 1, n, 1, a[p[i]] - 1);
    lst -= qry(rt[p[i] - 1], 1, n, a[p[i]] + 1, n) - qry(rt[l - 1], 1, n, a[p[i]] + 1, n);
    int lt = p[i] - 1, rr = p[i] + 1;
    if (lt - l < r - rr) {
      rep (j, l, lt) lst -= qry(rt[r], 1, n, 1, a[j] - 1) - qry(rt[rr - 1], 1, n, 1, a[j] - 1);
      ll L = inv(l, lt), R = lst - L;
      mp[pii(l, lt)] = L, mp[pii(rr, r)] = R;
      S.insert(L), S.insert(R);
    } else {
      rep (j, rr, r) lst -= qry(rt[lt], 1, n, a[j] + 1, n) - qry(rt[l - 1], 1, n, a[j] + 1, n);
      ll R = inv(rr, r), L = lst - R;
      mp[pii(l, lt)] = L, mp[pii(rr, r)] = R;
      S.insert(L), S.insert(R);
    }
    s.insert(pii(l, lt)), s.insert(pii(rr, r));
  }
  cout << '\n';
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}