#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

void test(){
	int n=ri();
	vector<int> a(n);
	rd(a);
	set<pair<pair<int,int>,int>> in;
	vector<pair<ordered_set<pair<int,int>>,ll>> sets;
	in.insert({{0,n-1},0});
	multiset<ll> cnts;
	ll cnt=0;
	ordered_set<pair<int,int>> st;
	for(int i=0;i<n;i++){
		cnt+=sz(st)-st.order_of_key({a[i]+1,-1});
		st.insert({a[i],i});
	}
	sets.pb({st,cnt});
	cnts.insert(cnt);
	for(int i=0;i<n;i++){
		ll br=*cnts.rbegin();
		printf("%lld",br);
		if(i!=n-1){
			printf(" ");
		}
		/*for(auto p:sets){
			printf("[");
			for(auto d:p.f){
				printf("(%i %i) ",d.f,d.s);
			}
			printf("], %lld\n",p.s);
		}*/
		ll p;
		rd(p);
		p^=br;
		p--;
		//printf("Brisem %i\n",p);
		auto it=in.lower_bound({{p,n},n});
		it--;
		int l=(*it).f.f,r=(*it).f.s,ind=(*it).s;
		in.erase(it);
		//printf("%i %i %i %i\n",l,r,ind,p);
		int levi=p-l,desni=r-p;
		cnts.erase(cnts.find(sets[ind].s));
		if(levi<desni){
			for(int i=l;i<=p;i++){
				sets[ind].f.erase({a[i],i});
			}
			for(int i=l;i<=p;i++){
				sets[ind].s-=sets[ind].f.order_of_key({a[i],-1});
			}
			if(l!=p){
				int newInd=sz(sets);
				ordered_set<pair<int,int>> novi;
				ll noviCnt=0;
				for(int i=l;i<p;i++){
					noviCnt+=sz(novi)-novi.order_of_key({a[i]+1,-1});
					novi.insert({a[i],i});
				}
				sets[ind].s-=noviCnt;
				cnts.insert(noviCnt);
				cnt+=noviCnt;
				sets[ind].s-=sz(novi)-novi.order_of_key({a[p]+1,-1});
				sets.pb({novi,noviCnt});
				in.insert({{l,p-1},newInd});
			}
			if(r!=p){
				in.insert({{p+1,r},ind});
				cnts.insert(sets[ind].s);
			}
		}
		else{
			for(int i=p;i<=r;i++){
				sets[ind].f.erase({a[i],i});
			}
			for(int i=p;i<=r;i++){
				sets[ind].s-=sz(sets[ind].f)-sets[ind].f.order_of_key({a[i]+1,-1});
			}
			if(r!=p){
				int newInd=sz(sets);
				ordered_set<pair<int,int>> novi;
				ll noviCnt=0;
				for(int i=p+1;i<=r;i++){
					noviCnt+=(int)novi.size()-novi.order_of_key({a[i]+1,-1});
					novi.insert({a[i],i});
				}
				sets[ind].s-=noviCnt;
				cnts.insert(noviCnt);
				sets[ind].s-=novi.order_of_key({a[p],-1});
				sets.pb({novi,noviCnt});
				in.insert({{p+1,r},newInd});
			}
			if(l!=p) {
				in.insert({{l,p-1},ind});
				cnts.insert(sets[ind].s);
			}
		}
	}
	printf("\n");
}
int main()
{
	int t=ri();
	while(t--){
		test();
	}
	return 0;
}