#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

#define N 500005

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

struct info{
    int f[9][9];
    info(){memset(f,0,sizeof(f));}
}c[9];
info merge(info x,info y){
    info z;
    for(int i=0;i<9;i++){
        for(int k=0;k<9;k++){
            for(int j=0;j<9;j++)z.f[i][j]|=x.f[i][k]&y.f[k][j];
        }
    }
    return z;
}
int id(int x,int y){
    return x+3*y;
}
void init(){
    for(int x=0;x<3;x++){
        for(int y=0;y<3;y++){
            for(int i=0;i<3;i++){
                for(int j=0;j<3;j++){
                    int u=min(i,x),v=min(y,j);
                    c[id(x,y)].f[id(i,j)][id(u,v)]=1;
                    u=max(i,x);v=max(y,j);
                    c[id(x,y)].f[id(i,j)][id(u,v)]=1;
                }
            }
        }
    }
}

int X=1,Y=1,n;
int res[N];
int cp(int x,int y){
    return (x==y?1:(x<y?0:2));
}
int a[N],b[N],A[N],B[N];

struct seg{
    int ls[N<<2],rs[N<<2],tot;info v[N<<2];
    void build(int &x,int l=2,int r=n){
        x=++tot;if(l==r)return v[x]=c[id(cp(a[l],X),cp(b[l],Y))],void();int mid=(l+r)>>1;
        build(ls[x],l,mid);build(rs[x],mid+1,r);v[x]=merge(v[ls[x]],v[rs[x]]);
    }
    void fresh(int x,int p,int l=2,int r=n){
        if(l==r)return v[x]=c[id(cp(a[l],X),cp(b[l],Y))],void();int mid=(l+r)>>1;
        (p<=mid)?fresh(ls[x],p,l,mid):fresh(rs[x],p,mid+1,r);v[x]=merge(v[ls[x]],v[rs[x]]);
    }
}T;

bool chk(){
    int now=id(cp(a[1],X),cp(b[1],Y));
    if(T.v[1].f[now][id(1,1)])return true;
    return false;
}

void solve(){
    n=read();T.tot=0;X=1;Y=1;
    for(int i=0;i<=n;i++)res[i]=0;
    for(int i=1;i<=n;i++)a[i]=read(),A[a[i]]=i;
    for(int i=1;i<=n;i++)b[i]=read(),B[b[i]]=i;
    int rt;T.build(rt);
    if(chk())res[abs(X-Y)]++;
    while(1){
        auto update=[&](int optx,int opty){
            if(optx){
                T.fresh(rt,A[X]);
                if(optx==1)T.fresh(rt,A[X-1]);
                else T.fresh(rt,A[X+1]);
            }
            if(opty){
                T.fresh(rt,B[Y]);
                if(opty==1)T.fresh(rt,B[Y-1]);
                else T.fresh(rt,B[Y+1]);
            }
        };
        if(X+1<=n){
            X++;update(1,0);
            if(chk()){res[abs(X-Y)]++;continue;}
            X--;update(2,0);
        }
        if(Y+1<=n){
            Y++;update(0,1);
            if(chk()){res[abs(X-Y)]++;continue;}
            Y--;update(0,2);
        }
        if(X+1<=n && Y+1<=n){
            X++;Y++;update(1,1);
            if(chk()){res[abs(X-Y)]++;continue;}
            break;
        }
        break;
    }
    for(int i=0;i<n;i++)write(res[i]),putchar(' ');
    putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif
    init();
    int T=read();while(T--)solve();
    return 0;
}