//It's MyGO!!!
//All OK
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(6)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define LNF (1ll << 60)
#define ll long long
#define ull unsighed long long
#define int long long
// #define mod 998244353
#define mod 1000000007
using namespace std;

const int N = 1e5 + 10;
int n, m, a[N], p[N];
int root[N], tot;
map<int, int> mp;
multiset<int> s;

struct Node
{
    int ls, rs;
    int sum;
}tr[N << 4];

int newpoint(){
    tot ++;
    tr[tot] = {0, 0, 0};
    return tot;
}

void modify(int a, int b, int l, int r, int idx){
    // cout << l << ' ' << r << ' ' << idx << '\n';
    tr[b] = tr[a];
    if(l == r){
        tr[b].sum ++;
        return;
    }
    int mid = l + r >> 1;
    if(idx <= mid) modify(tr[a].ls, tr[b].ls = newpoint(), l, mid, idx);
    else modify(tr[a].rs, tr[b].rs = newpoint(), mid + 1, r, idx);
    tr[b].sum = tr[tr[b].ls].sum + tr[tr[b].rs].sum;
}

int query(int u, int l, int r, int lx, int rx){
    // cout << u << ' ' << l << ' ' << r << ' ' << lx  << ' ' << rx << '\n';
    if(lx > rx) return 0;
    if(lx <= l && r <= rx) return tr[u].sum;

    int mid = l + r >> 1;
    ll res = 0;
    if(lx <= mid) res += query(tr[u].ls, l, mid, lx, rx);
    if(mid < rx) res += query(tr[u].rs, mid + 1, r, lx, rx);
    return res;
}

void splite(int l, int r, int x){
    // cout << l << ' ' << r << ' ' << mp[l] << endl;
    ll res = mp[l]; 
    s.erase(s.find(res));
    ll sum = query(root[r - 1], 1, n, 1, a[x] - 1) - query(root[x], 1, n, 1, a[x] - 1) + 
        query(root[x - 1], 1, n, a[x] + 1, n) - query(root[l], 1, n, a[x] + 1, n);
    if(x - l > r - x){
        ll s1 = 0, s2 = 0;
        for(int i = x + 1; i < r; i ++){
            s1 += query(root[i - 1], 1, n, a[i] + 1, n) - query(root[x], 1, n, a[i] + 1, n);
            s2 += query(root[x - 1], 1, n, a[i] + 1, n) - query(root[l], 1, n, a[i] + 1, n);
        }
        mp[l] = res - s1 - s2 - sum;
        mp[x] = s1;
        s.insert(res - s1 - s2 - sum);
        s.insert(s1);
    }
    else{
        ll s1 = 0, s2 = 0;
        for(int i = l + 1; i < x; i ++){
            s1 += query(root[i - 1], 1, n, a[i] + 1, n) - query(root[l], 1, n, a[i] + 1, n);
            s2 += query(root[r - 1], 1, n, 1, a[i] - 1) - query(root[x], 1, n, 1, a[i] - 1);
        }
        mp[x] = res - s1 - s2 - sum;
        mp[l] = s1;
        s.insert(res - s1 - s2 - sum);
        s.insert(s1);
    }
}

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];

    for(int i = 1; i <= n; i ++){
        modify(root[i - 1], root[i] = newpoint(), 1, n, a[i]);
    }

    ll sum = 0;
    for(int i = 1; i <= n; i ++){
        // cout << a[i] << ' ' << query(root[i - 1], 1, n, 1, a[i]) << '\n';
        sum += query(root[i - 1], 1, n, a[i] + 1, n);
    }
    // cout << sum << endl;
    mp[0] = sum;
    mp[n + 1] = 0;
    s.insert(sum), s.insert(0);

    for(int i = 1; i <= n; i ++){
        int x; cin >> x;
        cout << sum << ' ';
        x ^= sum;
        auto idx = mp.lower_bound(x);
        idx --;
        // cout << idx->first << ' ' << next(idx)->first << '\n';
        splite(idx->first, next(idx)->first, x);
        auto id = s.end();
        id --;
        sum = *id;
    }

    tot = 0; 
    mp.clear();
    s.clear();
    cout << '\n';
}

signed main(){
    ios;

    // init();
    int _ = 1;
    cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case #" << __ << ": ";

        solve();
    }
    return 0;
}