#include <bits/stdc++.h>
using namespace std;

typedef long long ll; typedef unsigned long long ull;
const int inf = 1e9; const ll llnf = 4e18;

template< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }
template< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }

template< class Int >
struct pqueue {
private:
	priority_queue< Int > p , q;

public:
	pqueue( ) { while( !p.empty( ) ) p.pop( ); while( !q.empty( ) ) q.pop( ); }
	void ins( Int x ) { p.emplace( x ); }
	void era( Int x ) { q.emplace( x ); }
	Int top( ) { while( !p.empty( ) && !q.empty( ) && p.top( ) == q.top( ) ) p.pop( ) , q.pop( ); return p.top( ); }
} ;

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

	int N = n * ( __lg( n ) + 8 ); vector< int > ls( N ) , rs( N ) , cnt( N ); vector< int > root( n + 1 ); int pnode = 0;
	auto add = [&] ( auto add , int &o , int p , int L , int R , int x ) -> void {
		o = ++ pnode; ls[o] = ls[p] , rs[o] = rs[p] , cnt[o] = cnt[p] + 1;
		if( L == x && R == x ) return void( );
		else { int M = ( L + R ) / 2; ( x <= M ) ? ( add( add , ls[o] , ls[p] , L , M , x ) ) : ( add( add , rs[o] , rs[p] , M + 1 , R , x ) ); }
	} ;
	auto qry = [&] ( auto qry , int o , int L , int R , int l , int r ) -> int {
		if( !o || l > R || r < L ) return 0;
		else if( l <= L && R <= r ) return cnt[o];
		else { int M = ( L + R ) / 2; return qry( qry , ls[o] , L , M , l , r ) + qry( qry , rs[o] , M + 1 , R , l , r ); }
	} ;

	for( int i = 1; i <= n; i ++ ) add( add , root[i] , root[i - 1] , 1 , n , a[i] );
	ll ninv = 0; for( int i = 1; i <= n; i ++ ) ninv += qry( qry , root[i - 1] , 1 , n , a[i] + 1 , n );
	pqueue< ll > pque; set< tuple< int , int , ll > > S; pque.ins( ninv ) , S.emplace( 1 , n , ninv );

	vector< ll > ans( n + 1 ); ans[0] = ninv;
	for( int t = 1; t <= n; t ++ ) {
		ll _k; cin >> _k; int k = _k ^ ans[t - 1];
		auto [ l , r , s ] = *prev( S.lower_bound( make_tuple( k + 1 , 0 , 0 ) ) ); S.erase( make_tuple( l , r , s ) ) , pque.era( s );

		if( k - l <= r - k ) {
			ll sl = 0 , sr = s - ( qry( qry , root[r] , 1 , n , 1 , a[k] - 1 ) - qry( qry , root[k] , 1 , n , 1 , a[k] - 1 ) );
			for( int i = l; i <= k - 1; i ++ ) sl += qry( qry , root[i - 1] , 1 , n , a[i] + 1 , n ) - qry( qry , root[l - 1] , 1 , n , a[i] + 1 , n );
			for( int i = l; i <= k - 1; i ++ ) sr -= qry( qry , root[r] , 1 , n , 1 , a[i] - 1 ) - qry( qry , root[i] , 1 , n , 1 , a[i] - 1 );
			if( l <= k - 1 ) S.emplace( l , k - 1 , sl ) , pque.ins( sl ); if( k + 1 <= r ) S.emplace( k + 1 , r , sr ) , pque.ins( sr );
		} else {
			ll sl = s - ( qry( qry , root[k - 1] , 1 , n , a[k] + 1 , n ) - qry( qry , root[l - 1] , 1 , n , a[k] + 1 , n ) ) , sr = 0;
			for( int i = k + 1; i <= r; i ++ ) sr += qry( qry , root[r] , 1 , n , 1 , a[i] - 1 ) - qry( qry , root[i] , 1 , n , 1 , a[i] - 1 );
			for( int i = k + 1; i <= r; i ++ ) sl -= qry( qry , root[i - 1] , 1 , n , a[i] + 1 , n ) - qry( qry , root[l - 1] , 1 , n , a[i] + 1 , n );
			if( l <= k - 1 ) S.emplace( l , k - 1 , sl ) , pque.ins( sl ); if( k + 1 <= r ) S.emplace( k + 1 , r , sr ) , pque.ins( sr );
		}

		if( t < n ) ans[t] = pque.top( );
	}

	for( int t = 0; t <= n - 1; t ++ ) cout << ans[t] << " \n"[t == n - 1]; cout.flush( );
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T; cin >> T; while( T -- ) solve( ); return 0;
}