//                          ? ? ? ? -? ? ?  ?? ??!

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<tuple>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const int NV=5e5;

namespace seg{
	const int N=1<<19;
    struct SEGN{
        int a[3];
    } tr[N*2];
    const SEGN I[3]={{0,0,1},{0,1,1},{1,1,2}};
    SEGN operator+(SEGN u,SEGN v){return {v.a[u.a[0]],v.a[u.a[1]],v.a[u.a[2]]};}
	void init(){std::fill(tr,tr+N*2,SEGN{0,1,2});}
	void upd(int x,SEGN z){
		for(tr[x+=N]=z,x/=2;x;x/=2)
            tr[x]=tr[x<<1]+tr[x<<1|1];
	}
}

namespace xm{
    int N,X,Y,a[NV+5],b[NV+5],pa[NV+5],pb[NV+5],mx[NV+5],\
        l[NV+5],r[NV+5],ans[NV+5];
    void ins(int x){
        if(x>1) seg::upd(x,seg::I[(a[x]>X)+(b[x]<Y)]);
    }void slv(){
        X=0;
        Y=1;
        for(int i=1;i<=N;++i) pa[a[i]]=pb[b[i]]=i;
        for(int i=2;i<=N;++i) ins(i);
        for(X=1;X<=N;++X){
            ins(pa[X]);
            while(Y<=N&&!seg::tr[1].a[(a[1]>X)+(b[1]<Y)]){
                ++Y;
                ins(pb[Y-1]);
            }
            mx[X]=Y-1;
        }
        for(int i=2;i<=N;++i) seg::upd(i,seg::SEGN{0,1,2});
    }void _(){
        scanf("%d",&N);
        std::fill(ans,ans+2*N+1,0);
        for(int i=1;i<=N;++i) scanf("%d",a+i);
        for(int i=1;i<=N;++i) scanf("%d",b+i);
        slv();
        for(int i=1;i<=N;++i){
            a[i]=N-a[i]+1;
            b[i]=N-b[i]+1;
            r[i]=mx[i];
        }
        slv();
        for(int i=1;i<=N;++i) l[N-i+1]=N-mx[i]+1;
        for(int i=1;i<=N;++i){
            ++ans[l[i]-i+N];
            --ans[r[i]-i+N+1];
        }
        for(int i=1;i<=N*2;++i) ans[i]+=ans[i-1];
        printf("%d ",ans[N]);
        for(int i=1;i<N;++i) printf("%d ",ans[N-i]+ans[N+i]);
        puts("");
    }
}

int main(){
    int t;
    seg::init();
    scanf("%d",&t);
    while(t--) xm::_();
    return 0;
}