#include<bits/stdc++.h>
using namespace std;
int n,m;
int a[1000005],b[1000005];
int la[1000005],cntla;
int sa[1000005];
int ra[1000005],cntra;
int lb[1000005],cntlb;
int sb[1000005];
int rb[1000005],cntrb;
struct Tree{
	int tree[2000005];
	void clear(int x){x+=1000000;for(;x<=2000000;x+=x&-x)tree[x]=-0x3f3f3f3f;}
	void add(int x,int y){x+=1000000;for(;x<=2000000;x+=x&-x)tree[x]=max(tree[x],y);}
	int ask(int x){x+=1000000;int res=-0x3f3f3f3f;for(;x;x&=x-1)res=max(res,tree[x]);return res;}
}T[2];
int main(){
	int _;scanf("%d",&_);
	memset(T[0].tree,-0x3f,sizeof(T[0].tree));
	memset(T[1].tree,-0x3f,sizeof(T[1].tree));
	while(_--){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		for(int i=1;i<=m;i++)scanf("%d",&b[i]);
		la[cntla=0]=0;
		for(int i=1;i<=n;i++)if(a[i]==1)la[++cntla]=i;
		ra[cntra=0]=n+1;
		for(int i=n;i>=1;i--)if(a[i]==3)ra[++cntra]=i;
		lb[cntlb=0]=0;
		for(int i=1;i<=m;i++)if(b[i]==1)lb[++cntlb]=i;
		rb[cntrb=0]=m+1;
		for(int i=m;i>=1;i--)if(b[i]==3)rb[++cntrb]=i;
		for(int i=1;i<=n;i++)sa[i]=sa[i-1]+(a[i]==2);
		for(int i=1;i<=m;i++)sb[i]=sb[i-1]+(b[i]==2);
		int ans=0;
		for(int i=min(cntra,cntrb),j=-1;i>=0;i--){
			while(j<min(cntla,cntlb)&&la[j+1]<ra[i]&&lb[j+1]<rb[i]){
				j++;
				T[0].add(sb[lb[j]]-sa[la[j]],j-sa[la[j]]);
				T[1].add(sa[la[j]]-sb[lb[j]],j-sb[lb[j]]);
			}
			ans=max(ans,i+sa[ra[i]-1]+T[0].ask(sb[rb[i]-1]-sa[ra[i]-1]));
			ans=max(ans,i+sb[rb[i]-1]+T[1].ask(sa[ra[i]-1]-sb[rb[i]-1]));
		}
		for(int i=1;i<=min(cntla,cntlb);i++)T[0].clear(sb[lb[i]]-sa[la[i]]),T[1].clear(sa[la[i]]-sb[lb[i]]);
		printf("%d\n",ans);
	}
	return 0;
}