#include <bits/extc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < (b); i++)
#define sz(a) ssize(a)
bool chmin(auto& a, auto b) { if(a <= b) return 0; a = b; return 1; }
bool chmax(auto& a, auto b) { if(a >= b) return 0; a = b; return 1; }

using namespace __gnu_pbds;
template<class T> using pbds_set = tree<T, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
struct T {
    pbds_set<ll> s;
    ll cost = 0;
    void push_back(ll x) {
        cost += sz(s) - s.order_of_key(x);
        s.insert(x);
    }
    void pop_back(ll x) {
        s.erase(x);
        cost -= sz(s) - s.order_of_key(x);
    }
    void pop_front(ll x) {
        s.erase(x);
        cost -= s.order_of_key(x);
    }
};
void solve() {
    ll N;
    cin >> N;
    vector<ll> A(N), P(N);
    for(ll& a : A) cin >> a;
    {
        vector<ll> idx(N);
        rep(i, 0, N) idx[i] = i;
        ranges::stable_sort(idx, {}, [&](ll i) { return A[i]; });
        rep(i, 0, N) A[idx[i]] = i;
    }
    for(ll& a : P) cin >> a;
    map<ll, ll> interval;
    multiset<ll> costs {0};
    vector<T> cc(N);
    auto add = [&](ll l, ll r, T& t) {
        if(l > r) return;
        interval.emplace(l, r);
        costs.insert(t.cost);
        swap(cc[l], t);
    };
    auto push = [&](ll l, ll r) {
        if(l > r) return;
        interval[l] = r;
        T t;
        rep(i, l, r + 1) t.push_back(A[i]);
        add(l, r, t);
    };
    auto rem = [&](ll l, ll r) {
        auto& t = cc[l];
        interval.erase(l);
        costs.erase(costs.find(t.cost));
    };
    auto erase = [&](ll i) {
        auto p = --interval.upper_bound(i);
        auto [l, r] = *p;
        T& t = cc[l];
        rem(l, r);
        if(r - i < i - l) {
            for(ll j = r; j >= i; j--) t.pop_back(A[j]);
            add(l, i - 1, t);
            push(i + 1, r);
        }
        else {
            rep(j, l, i + 1) t.pop_front(A[j]);
            add(i + 1, r, t);
            push(l, i - 1);
        }
    };
    push(0, N - 1);
    vector<ll> ans;
    ll prev = 0;
    for(ll p : P) {
        prev = *rbegin(costs);
        ans.push_back(prev);
        p ^= prev;
        p--;
        erase(p);
    }
    rep(i, 0, N) cout << ans[i] << " \n"[i + 1 == N];
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T;
    cin >> T;
    while(T--) solve();
}