#define taskname "G"
#include <bits/stdc++.h>
#define int long long
#define iii array<int, 3>
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;
const int maxn = 1e5 + 10;
int f[maxn], n, a[maxn];
vector<int> fen[maxn];
map<ii,int> res;

inline void upd2(int pos, int val) {for (; pos<=n; pos+=pos&-pos) fen[pos].emplace_back(val);}
inline void upd(int pos, int val) {for (; pos<=n; pos+=pos&-pos) f[pos]+=val;}
inline int ask(int pos) {int ans=0; for(; pos; pos-=pos&-pos) ans += f[pos]; return ans;}
inline int askless(int pos, int val)
{
    int ans=0;
    for (; pos; pos-=pos&-pos)
        ans += lower_bound(fen[pos].begin(), fen[pos].end(), val) - fen[pos].begin();
        return ans;
}
inline int askmore(int pos, int val)
{
    int ans=0;
    for (; pos; pos-=pos&-pos)
        ans += fen[pos].end() - upper_bound(fen[pos].begin(), fen[pos].end(), val);
        return ans;
}
inline int qry(int l, int r) {return ask(r) - ask(l-1);}
inline int qryless(int l, int r, int val) {return askless(r, val) - askless(l-1, val);}
inline int qrymore(int l, int r, int val) {return askmore(r, val) - askmore(l-1, val);}

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin.tie(nullptr); cout.tie(nullptr);
    int tst; cin>>tst; while (tst--)
    {
        cin>>n;
        res.clear();
        for (int i=1; i<=n; i++) f[i] = 0, fen[i].clear();
        int ans = 0;
        for (int i=1; i<=n; i++)
        {
            cin>>a[i];
            ans += qry(a[i]+1, n);
            upd(a[i], 1);
            upd2(i, a[i]);
        }
        for (int i=1; i<=n; i++) sort(fen[i].begin(), fen[i].end());
        for (int i=1; i<=n; i++) f[i] = 0;
        res[{1, n}] = ans;
        set<iii, greater<iii>> s;
        set<ii> seg;
        s.insert({ans, 1, n});
        seg.emplace(n, 1);
        // cout<<"BRUH: "<<n<<"\n";
        for (int i=1, x; i<=n; i++)
        {
            assert(!s.empty());
            ans = (*s.begin())[0];
            cout<<ans<<" ";
            cin>>x;
            x ^= ans;
            auto [r, l] = *seg.lower_bound({x, 0});
            int init = res[{l, r}];
            s.erase({init, l, r});
            seg.erase({r, l});
            if (r - x < x - l)
            {
                int tmp = 0, rem = 0, newval = init;
                for (int i=x+1; i<=r; i++)
                {
                    tmp += qry(a[i]+1, n);
                    upd(a[i], 1);
                    rem += qrymore(l, x, a[i]);
                }
                newval -= tmp;
                newval -= rem;
                newval -= qrymore(l, x-1, a[x]);
                for (int i=x+1; i<=r; i++) upd(a[i], -1);
                if (x+1 <= r) s.insert({tmp, x+1, r}), seg.emplace(r, x+1), res[{x+1, r}] = tmp;
                if (x-1 >= l) s.insert({newval, l, x-1}), seg.emplace(x-1, l), res[{l, x-1}] = newval;
            }
            else
            {
                int tmp = 0, rem = 0, newval = init;
                for (int i=l; i<x; i++)
                {
                    tmp += qry(a[i]+1, n);
                    upd(a[i], 1);
                    rem += qryless(x, r, a[i]);
                }
                newval -= tmp;
                newval -= rem;
                newval -= qryless(x+1, r, a[x]);
                // if (newval < 0) cout<<"BUG: "<<l<<" "<<x-1<<" "<<newval<<"\n";
                // assert(newval >= 0);
                // cout<<"HMMMMM: "<<l<<" "<<x<<" "<<r<<" "<<init<<" "<<tmp<<" "<<rem<<" "<<newval<<"\n";
                for (int i=l; i<x; i++) upd(a[i], -1);
                if (x+1 <= r) s.insert({newval, x+1, r}), seg.emplace(r, x+1), res[{x+1, r}] = newval;
                if (x-1 >= l) s.insert({tmp, l, x-1}), seg.emplace(x-1, l), res[{l, x-1}] = tmp;
            }
        }
        cout<<"\n";
    }

}
/**
 * 3
5
4 3 1 1 1
5 4 5 3 1
10
9 7 1 4 7 8 5 7 4 8
21 8 15 5 9 2 4 5 10 6
15
4 8 8 1 12 1 10 14 7 14 2 9 13 10 3
37 19 23 15 7 2 10 15 2 13 4 5 8 7 10
*/