#include<bits/stdc++.h>
const int QWQ=1e6+5;
using namespace std;
inline int read(){
    int x=0; char ch=getchar();
    for (;ch<'0'||ch>'9';ch=getchar());
    for (;ch>='0'&&ch<='9';ch=getchar())
        x=(x<<1)+(x<<3)+(ch^48);
    return x; 
}
int T,n,m,a[QWQ],b[QWQ],s[QWQ*2];
int La[QWQ],Lb[QWQ],Ra[QWQ],Rb[QWQ];
int Lac,Lbc,Rac,Rbc,lim,res;
int suma[QWQ],sumb[QWQ];
inline int lowbit(int x){ return x&(-x); }
void add(int x,int v){
	for (;x<=lim*2;x+=lowbit(x))
		s[x]=max(s[x],v);
}
int ask(int x,int ret=0){
	for (;x;x-=lowbit(x))
		ret=max(ret,s[x]);
	return ret;
}
signed main(){
	for (T=read();T--;){
		n=read(),m=read(),lim=max(n,m)+1;
		Lac=Lbc=Rac=Rbc=res=0;
		for (int i=1;i<=n;i++) a[i]=read();
		for (int i=1;i<=m;i++) b[i]=read();
		a[n+1]=b[m+1]=0;
		for (int i=1;i<=n;i++)
			if (a[i]==1) La[++Lac]=i;
		for (int i=1;i<=m;i++)
			if (b[i]==1) Lb[++Lbc]=i;
		for (int i=n;i>=1;i--)
			if (a[i]==3) Ra[++Rac]=i;
		for (int i=m;i>=1;i--)
			if (b[i]==3) Rb[++Rbc]=i;
		for (int i=1;i<=n+1;i++)
			suma[i]=suma[i-1]+(a[i]==2);
		for (int i=1;i<=m+1;i++)
			sumb[i]=sumb[i-1]+(b[i]==2);
		La[0]=0,Lb[0]=0,Ra[0]=n+1,Rb[0]=m+1;
		int Lic=min(Lac,Lbc),Ric=min(Rac,Rbc);
		fill(s,s+lim*2+1,0);
		// suma[Ra[j]]-suma[La[i]]<=sumb[Rb[j]]-sumb[Lb[i]];
		for (int i=Lic,j=0;i>=0;i--){
			while (j<=Ric&&La[i]<Ra[j]&&Lb[i]<Rb[j])
				add(suma[Ra[j]]-sumb[Rb[j]]+lim,j+suma[Ra[j]]),j++;
			res=max(res,ask(suma[La[i]]-sumb[Lb[i]]+lim)+i-suma[La[i]]);
		}
		fill(s,s+lim*2+1,0);
		// suma[Ra[j]]-suma[La[i]]>=sumb[Rb[j]]-sumb[Lb[i]];
		for (int i=Lic,j=0;i>=0;i--){
			while (j<=Ric&&La[i]<Ra[j]&&Lb[i]<Rb[j])
				add(sumb[Rb[j]]-suma[Ra[j]]+lim,j+sumb[Rb[j]]),j++;
			res=max(res,ask(sumb[Lb[i]]-suma[La[i]]+lim)+i-sumb[Lb[i]]);
		}
		printf("%d\n",res);
	}
	return 0;
}
// 白咲花可爱！