#include<bits/stdc++.h>
using namespace std;

const int N=1e6+5,O=1e9;
int n,m,a[N],b[N];
int Sa[N],La[N],Ra[N],Sb[N],Lb[N],Rb[N];

inline void rd(int a[],int n,int S[],int L[],int R[]){
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	L[0]=0;R[0]=n+1;
	for(int i=1,c=0;i<=n;i++)if(a[i]==1)L[++c]=i;
	for(int i=n,c=0;i>=1;i--)if(a[i]==3)R[++c]=i;
	for(int i=1;i<=n;i++)S[i]=S[i-1]+(a[i]==2);
}
inline void solve(){
	scanf("%d%d",&n,&m);
	rd(a,n,Sa,La,Ra);rd(b,m,Sb,Lb,Rb);
	int c1a=0,c3a=0,c1b=0,c3b=0;
	for(int i=1;i<=n;i++){c1a+=a[i]==1;c3a+=a[i]==3;}
	for(int i=1;i<=m;i++){c1b+=b[i]==1;c3b+=b[i]==3;}
	int c1=min(c1a,c1b),c3=min(c3a,c3b);
	int ans=0;
	for(int i=0;i<=c1;i++){
		int res=-O;
		for(int j=0;j<=c3;j++)
			if(La[i]<Ra[j]&&Lb[i]<Rb[j]&&Sa[Ra[j]-1]-Sb[Rb[j]-1]<=Sa[La[i]]-Sb[Lb[i]])
				res=max(res,j+Sa[Ra[j]-1]);
		ans=max(ans,res+i-Sa[La[i]]);
		res=-O;
		for(int j=0;j<=c3;j++)
			if(La[i]<Ra[j]&&Lb[i]<Rb[j]&&Sa[Ra[j]-1]-Sb[Rb[j]-1]>=Sa[La[i]]-Sb[Lb[i]])
				res=max(res,j+Sb[Rb[j]-1]);
		ans=max(ans,res+i-Sb[Lb[i]]);
	}
	printf("%d\n",ans);
}
int main(){
	int T;scanf("%d",&T);
	while(T--)solve();
	return 0;
}