/*

*/
#include <bits/stdc++.h>
using namespace std;
inline long long read(){
    long long x=0,w=0;char c=0;
    while(!isdigit(c)) {w|=c=='-';c=getchar();}
    while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
    return w?-x:x;
}
int T,n,m,a[5000500],b[5005000],ans;
int La[5005000],cnta1,suma[5000500],Ra[5000050],cnta3;
int Lb[5005000],cntb1,sumb[5000500],Rb[5000500],cntb3;
int c1[5000500],c2[5000500],tot,now1,now2;
inline int lowbit(int x){
	return x&(-x);
}
inline void up(int*c,int x,int y){
	while(x<=now2*2){
		c[x]=max(c[x],y);
		x+=lowbit(x);
	}
}
inline int ask(int*c,int x){
	int res=-1e9;
	while(x){
		res=max(res,c[x]);
		x-=lowbit(x);
	}
	return res;
}
int main(){ 
	T=read();
	while(T--){
		n=read();
		m=read();
		La[0]=Lb[0]=0;
		Ra[0]=n+1;
		Rb[0]=m+1;
		for(int i=1;i<=n;i++){
			La[i]=n+1;
			Ra[i]=0;
		}
		for(int i=1;i<=m;i++){
			Lb[i]=m+1;
			Rb[i]=0;
		}
		cnta1=cntb1=cnta3=cntb3=0;
		for(int i=1;i<=n;i++){
			a[i]=read();
			if(a[i]==1){
				La[++cnta1]=i;
			}
			suma[i]=suma[i-1]+(a[i]==2);
		}
		for(int i=1;i<=m;i++){
			b[i]=read();
			if(b[i]==1){
				Lb[++cntb1]=i;
			}
			sumb[i]=sumb[i-1]+(b[i]==2);
		}
		for(int i=n;i;i--){
			if(a[i]==3){
				Ra[++cnta3]=i;
			}
		}
		for(int i=m;i;i--){
			if(b[i]==3){
				Rb[++cntb3]=i;
			}
		}
		ans=0;
		now1=min(n,m),now2=max(n,m);
		for(int i=0;i<=now2*2;i++){
			c1[i]=c2[i]=-1e9;
		}
		for(int i=0,j=now1;~j;j--){
			for(;i<=now1&&La[i]<Ra[j]&&Lb[i]<Rb[j];i++){
				up(c1,suma[La[i]]-sumb[Lb[i]]+now2,i-sumb[Lb[i]]);
				up(c2,sumb[Lb[i]]-suma[La[i]]+now2,i-suma[La[i]]);
			}
			// fprintf(stderr,"%d %d\n",i,j);
			ans=max(ans,max(j+sumb[Rb[j]-1]+ask(c1,suma[Ra[j]-1]-sumb[Rb[j]-1]+now2),j+suma[Ra[j]-1]+ask(c2,sumb[Rb[j]-1]-suma[Ra[j]-1]+now2)));
		}
		printf("%d\n",ans);
// fprintf(stderr,"\n");
	}
	return 0; 
}