#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define error           \
    {                   \
        cout << "No\n"; \
        return;         \
    }
#define all(x) (x.begin(), x.end())
const int N = 1e6 + 10;
int a[N], p[N];
int n, m;
int res;
map<int, int> mp; // 以l为索引
multiset<int> st;
struct SegT
{

    int lc, rc;
    int su;
#define lc(p) t[p].lc
#define rc(p) t[p].rc
#define su(p) t[p].su
} t[N << 2];
int tot;
void up(int p)
{

    su(p) = su(lc(p)) + su(rc(p));
}
int build(int l, int r)
{

    int p = ++tot;
    if (l == r)
    {
        return p;
    }
    int mid = (l + r) >> 1;
    t[p].lc = build(l, mid);
    t[p].rc = build(mid + 1, r);
    up(p);
    return p;
}
int insert(int now, int l, int r, int x, int val)
{

    int p = ++tot;
    t[p] = t[now];
    if (l == r)
    {

        t[p].su++;
        return p;
    }
    int mid = (l + r) >> 1;
    if (x <= mid)
    {

        lc(p) = insert(lc(now), l, mid, x, val);
    }
    else
    {

        rc(p) = insert(rc(now), mid + 1, r, x, val);
    }
    up(p);
    return p;
}
int ask(int p, int L, int R, int l = 1, int r = n)
{

    if (l>r||L>R)
        return 0;
    int mid = (l + r) >> 1;
    if (L <= l && r <= R)
        return su(p);
    if (R <= mid)
        return ask(lc(p), L, R, l, mid);
    else if (L > mid)
        return ask(rc(p), L, R, mid + 1, r);
    else 
        return ask(lc(p), L, R, l, mid) + ask(rc(p), L, R, mid + 1, r);
}
int root[N];
int get(int L, int R, int l, int r)
{
    if(L>R) return 0;
    if(L<=1) return ask(root[R],l,r);
    if(R>n) return ask(root[n],l,r)-ask(root[L-1],l,r);
    return ask(root[R], l, r) - ask(root[L-1], l, r);
}

void split(int ps)
{

    auto it = mp.upper_bound(ps);
    int l = prev(it)->first, r = (it->first) - 1;
    int ans = prev(it)->second;
    // cout<<l<<" "<<ps<<" "<<r<<"\n";
    if (ps - l < r - ps)
    {

        int ans1, ans2;
        ans1 = ans2 = 0;
        for (int i = l; i < ps; i++)
        {

            int x = a[i];
            ans1 += get(l, i, x + 1, n);
        }

        ans2 = ans - ans1 - get(l, ps, a[ps] + 1, n);
        for (int i = l; i <= ps; i++)
        {

            ans2 -= get(ps + 1, r, 1, a[i] - 1);
        }
        st.erase(st.lower_bound(ans));
        mp[l]=ans1;
        mp[ps + 1]=ans2;
        st.insert(ans1);
        st.insert(ans2);
        mp[ps]=0;
        res = *prev(st.end());
    }
    else
    {   
        // cout<<"Hello\n";
        int ans1, ans2;
        ans1 = ans2 = 0;
        for (int i = ps + 1; i <= r; i++)
        {

            int x = a[i];
            ans2 += get(ps + 1, i, x + 1, n);
        }
        // cout << get1(ps, r, 1, a[ps] - 1) << "\n";
        ans1 = ans - ans2 - get(ps, r, 1, a[ps] - 1);
        for (int i = ps; i <= r; i++)
        {

            ans1 -= get(l, ps-1, a[i] + 1, n);
        }
        // cout<<ans1<<" "<<ans2<<"\n";
        st.erase(st.lower_bound(ans));
        mp[l]=ans1;
        st.insert(ans1);
        st.insert(ans2);
        mp[ps+1]=ans2;
        mp[ps]=0;
        res = *prev(st.end());
    }
}
void solve()
{
    st.clear();
    mp.clear();
    tot = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> p[i];

    for (int i = 1; i <= n; i++)
    {

        int x = a[i];
        root[i] = insert(root[i - 1], 1, n, x, 1);
        res += ask(root[i-1],x+1,n);
    }
    mp[1]=res;
    mp[n+1]=0;
    mp[0]=0;
    // cout<<res<<"\n";
    st.insert(res);
    for (int i = 1; i <= n; i++)
    {

        cout << res << " ";
        int ps = res ^ p[i];
        // cout<<ps<<"\n";
        // cout<<"\n";
        // 使ps位置的数失效
        split(ps);
    }
    cout<<"\n";
    return;
}
signed main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {

        solve();
    }
}