#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, j, k) for(int i=j;i<=k;++i)
#define rep1(i, j, k) for(int i=k;i>=j;--i)
#define pii pair<int, int> 
#define pb push_back
#define ft first
#define sd second

using namespace std;

const int N=1e5+5, inf=2e9;
int n, t, a[N], b[N], c[N], pla[N];
pii d[N];
vector<int> v[N];

int mi[N<<2], fro[N<<2];
int tag[N<<2];

#define lz id<<1
#define rz id<<1|1
#define mid ((l+r)>>1)

void pushup(int id){
	if(mi[lz]<=mi[rz]) mi[id]=mi[lz], fro[id]=fro[lz];
	else mi[id]=mi[rz], fro[id]=fro[rz];
}

void build(int id, int l, int r){
	mi[id]=inf, tag[id]=0;
	if(l==r) return mi[id]=-l, void();
	build(lz, l, mid), build(rz, mid+1, r);
	pushup(id);
}

void build1(int id, int l, int r){
	mi[id]=inf;
	if(l==r) return mi[id]=pla[l], fro[id]=l, void();
	build1(lz, l, mid), build1(rz, mid+1, r);
	pushup(id);
}

void upd(int id, int l, int r, int p){
	if(l>=p) return ++mi[id], ++tag[id], void();
	if(tag[id]){
		tag[lz]+=tag[id], tag[rz]+=tag[id];
		mi[lz]+=tag[id], mi[rz]+=tag[id];
		tag[id]=0;
	}
	if(p<=mid) upd(lz, l, mid, p);
	upd(rz, mid+1, r, p);
	pushup(id);
}

void upd1(int id, int l, int r, int p){
	if(l==r) return mi[id]=inf, void();
	if(p<=mid) upd1(lz, l, mid, p);
	else upd1(rz, mid+1, r, p);
	pushup(id);
}

pii qry1(int id, int l, int r, int p){
	if(l>=p) return {mi[id], fro[id]};
	pii x=qry1(rz, mid+1, r, p);
	if(p<=mid) x=min(x, qry1(lz, l, mid, p));
	return x;
}

int ans[N];

set<int> s;
multiset<pii> ss;

signed main(){
	
	scanf("%d", &t);
	while(t--){
		scanf("%d", &n);
		rep(i, 1, n) scanf("%d", a+i);
		rep(i, 1, n) scanf("%d", b+i);
		rep(i, 1, n) scanf("%d", c+i);
		
		s.clear(), ss.clear();
		rep(i, 1, n) v[i].clear();
		
		int cnt=0;
		rep(i, 1, n) if(!b[i]) ++cnt;
		
		build(1, 1, cnt);
		if(!t) cout<<n<<" "<<cnt<<" ";
		int x=0, sum=0;
		rep(i, 1, n){
			if(!b[i]){
				d[++sum]={c[i], i};
				if(sum==cnt){
					sort(d+1, d+cnt+1);
					rep(j, 1, i){
						if(!b[j]) continue;
						pii fd={c[j], 0};
						int p=lower_bound(d+1, d+cnt+1, fd)-d;
						if(p<=cnt) upd(1, 1, cnt, p), v[p].pb(j);
					}
				}
			}else if(sum==cnt){
				pii fd={c[i], 0};
				int p=lower_bound(d+1, d+cnt+1, fd)-d;
				if(p<=cnt) upd(1, 1, cnt, p), v[p].pb(i);
			}
			if(mi[1]==0){
				x=i;
				break;
			}
			ans[i]=-1;
		}
		
		if(!t) cout<<x<<endl;
		
		if(!x){
			rep(i, 1, cnt) printf("%d ", ans[i]);
			continue;
		}
		
		rep(i, 1, cnt){
			for(int it : v[i]) s.insert(it);
			auto it=s.upper_bound(d[i].sd);
			if(it==s.end()) --it, pla[i]=*it;
			else pla[i]=inf;
			s.erase(it);
		}
		
		build1(1, 1, cnt);
		
		if(mi[1]^inf) ans[x]=2*a[x]-a[mi[1]];
		else ans[x]=a[x];
		rep(i, x+1, n){
			pii fd={c[i], 0};
			int p=lower_bound(d+1, d+cnt+1, fd)-d;
			if(p<=cnt){
				pii x=qry1(1, 1, cnt, p);
				upd1(1, 1, cnt, x.sd);
			}
			if(mi[1]^inf) ans[i]=2*a[i]-a[mi[1]];
			else ans[i]=a[i];
		}
		
		rep(i, 1, n) printf("%d ", ans[i]);
		puts("");
		
	}
	
	return 0;
}