#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-8;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N],B[N],ans[N],pl[N];
struct node{
	int a,b;
	node operator +(const node &B)const{
		if(B.b==-1) return B;
		if(b==-1) return (node){min(max(B.a,a),B.b),-1};
		if(b<B.a) return (node){B.a,-1};
		if(a>B.b) return (node){B.b,-1};
		return (node){max(a,B.a),min(b,B.b)};
	}
	int calc(int x){
		return ~b?min(max(a,x),b):a;
	}
}C[N],l[N],r[N];
namespace SgT{
	#define ls v<<1
	#define rs v<<1|1
	node f[M];
	void up(int v){f[v]=f[ls]+f[rs];}
	void modify(int x,node y,int l=1,int r=n,int v=1){
		if(l==r){f[v]=y;return;}int m=l+r>>1;
		x<=m?modify(x,y,l,m,ls):modify(x,y,m+1,r,rs);up(v);
	}
	node qry(int x,int y,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) return f[v];int m=l+r>>1;
		if(y<=m) return qry(x,y,l,m,ls);if(x>m) return qry(x,y,m+1,r,rs);
		return qry(x,y,l,m,ls)+qry(x,y,m+1,r,rs);
	}
	#undef ls
	#undef rs
}
struct Tree{
	#define ls v<<1
	#define rs v<<1|1
	int f[M];node g[M];
	void up(int v){f[v]=min(f[ls],f[rs]);}
	void Pg(int v,node w){
		if(f[v]==INF) return;
		g[v]=g[v]+w;f[v]=w.calc(f[v]);
	}
	void P(int v){
		if(g[v].a^-INF||g[v].b^INF) Pg(ls,g[v]),Pg(rs,g[v]),g[v]=(node){-INF,INF};
	}
	void modify(int x,node y,int l=1,int r=n,int v=1){
		if(l==r){f[v]=y.calc(f[v]);return;}int m=l+r>>1;P(v);
		x<=m?modify(x,y,l,m,ls):modify(x,y,m+1,r,rs);up(v);
	}
	void add(int x,int y,node z,int l=1,int r=n,int v=1){
		if(x>y) return;
		if(x<=l&&r<=y) return Pg(v,z);int m=l+r>>1;P(v);
		x<=m&&(add(x,y,z,l,m,ls),0);y>m&&(add(x,y,z,m+1,r,rs),0);up(v);
	}
	int qry(int x,int y,int l=1,int r=n,int v=1){
		if(x>y) return INF;
		if(x<=l&&r<=y) return f[v];int m=l+r>>1;P(v);
		return min(x<=m?qry(x,y,l,m,ls):INF,y>m?qry(x,y,m+1,r,rs):INF);
	}
	void build(int l=1,int r=n,int v=1){
		f[v]=INF;g[v]=(node){-INF,INF};if(l==r) return;
		int m=l+r>>1;build(l,m,ls);build(m+1,r,rs);
	}
	#undef ls
	#undef rs
}f1,f2;
pii pus[N*8];int ph;
void add(int x,int y){pus[++ph]=make_pair(x,y);}
void work(node x,int A,int l,int r){
	int mi=f1.qry(l,r),mx=n-f2.qry(l,r);//gdb(mi,mx);
	if(x.b==-1){
		if(mi^INF) add(A,x.a);
	}else{
		if(mi<=x.a) add(A,x.a);
		if(mx>=x.b) add(A,x.b);
	}
}
void calc(int *A,int *B){
	int i,j;for(i=1;i<=n;i++) pl[A[i]]=i;
	for(i=1;i<=n;i++) SgT::modify(i,(node){-INF,B[i]});
	for(i=1;i<=n;i++){
		int id=pl[i];
		l[id]=SgT::qry(id,n);
		SgT::modify(id,(node){B[id],INF});
		r[id]=SgT::qry(id,n);
	}
	if(l[1].b==-1) add(A[1],l[1].a);
	else add(A[1],l[1].b);
	f1.build();f2.build();
	f1.modify(A[1],(node){-INF,B[1]});f2.modify(A[1],(node){-INF,n-B[1]});
	for(i=2;i<=n;i++){
		work(l[i],A[i],A[i],n);work(r[i],A[i],1,A[i]);
		int mi=f1.qry(A[i]+1,n),mx=n-f2.qry(A[i]+1,n);
		if(mi^INF){
			mi=min(mi,B[i]);mx=min(mx,B[i]);
			f1.modify(A[i],(node){-INF,mi});f2.modify(A[i],(node){-INF,n-mx});
		}
		mi=f1.qry(1,A[i]-1),mx=n-f2.qry(1,A[i]-1);
		if(mi^INF){
			mi=max(mi,B[i]);mx=max(mx,B[i]);
			f1.modify(A[i],(node){-INF,mi});f2.modify(A[i],(node){INF,n-mx});
		}
		f1.add(1,A[i]-1,(node){-INF,B[i]});f2.add(1,A[i]-1,(node){n-B[i],INF});
		f1.add(A[i]+1,n,(node){B[i],INF});f2.add(A[i]+1,n,(node){-INF,n-B[i]});
		// for(int j=1;j<A[i];j++)if(f1[j]^INF) f1[j]=min(f1[j],B[i]),f2[j]=min(f2[j],B[i]);
		// for(int j=A[i]+1;j<=n;j++) if(f1[j]^INF) f1[j]=max(f1[j],B[i]),f2[j]=max(f2[j],B[i]);
	}
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	for(i=1;i<=n;i++) scanf("%d",&B[i]);
	ph=0;
	calc(A,B);
	for(i=1;i<=ph;i++) swap(pus[i].fi,pus[i].se);
	calc(B,A);
	if(n^100000) sort(pus+1,pus+ph+1);ph=unique(pus+1,pus+ph+1)-pus-1;
	fill(ans,ans+n,0);for(i=1;i<=ph;i++) ans[abs(pus[i].fi-pus[i].se)]++;
	for(i=0;i<n;i++) printf("%d%c",ans[i]," \n"[i==n-1]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}