#include <bits/stdc++.h>
using namespace std;
const int N=1e6+15;
int read(){
	int s=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f*=-1;
		c=getchar();
	}
	while(c<='9'&&c>='0'){
		s=(s<<1)+(s<<3)+(c^48);
		c=getchar();
	}
	return f*s;
}
int T,n,m;
int a[N],la[N],ra[N],sa[N],numla,numra,b[N],lb[N],rb[N],sb[N],numlb,numrb;
int ans;
struct node{
	int c[N<<2];
	int low(int x){
		return x&(-x);
	}
	void update(int x,int val){
		for(int i=x;i<=(n+m)*2;i+=low(i)){
			c[i]=max(c[i],val);
		}
	}
	int ask(int x){
		int res=-1e9;
		for(int i=x;i;i-=low(i)){
			res=max(res,c[i]);
		}
		return res;
	}
}tr1,tr2;
int main(){
	T=read();
	while(T--){
		n=read(),m=read();
		la[0]=ra[0]=lb[0]=rb[0]=0;
		for(int i=1;i<=n;i++){
			a[i]=read();
			sa[i]=sa[i-1]+(a[i]==2);
			if(a[i]==1)la[++la[0]]=i;
		}
		for(int i=n;i;i--){
			if(a[i]==3)ra[++ra[0]]=i;
		}
		for(int i=0;i<=(m+n)*2;i++){
			tr1.c[i]=tr2.c[i]=-1e9;
		}
		numla=la[0],numra=ra[0];
		ra[0]=n+1;
		sa[n+1]=sa[n];
		//
		for(int i=1;i<=m;i++){
			b[i]=read();
			sb[i]=sb[i-1]+(b[i]==2);
			if(b[i]==1)lb[++lb[0]]=i;
		}
		for(int i=m;i;i--){
			if(b[i]==3)rb[++rb[0]]=i;
		}
		numlb=lb[0],numrb=rb[0];
		rb[0]=m+1;
		sb[m+1]=sb[m];
		//
		la[0]=lb[0]=0;
		int i=-1;
		ans=0;
		for(int j=min(numrb,numra);j>=0;j--){
			while(i<min(numla,numlb)&&la[i+1]<ra[j]&&lb[i+1]<rb[j]){
				i++;
				tr1.update(sb[lb[i]]-sa[la[i]]+n+m,i-sa[la[i]]);
				tr2.update(sa[la[i]]-sb[lb[i]]+n+m,i-sb[lb[i]]);
			}
			int val=sb[rb[j]]-sa[ra[j]];
			ans=max(ans,tr1.ask(val+n+m)+sa[ra[j]]+j);
			val=0-val;
			ans=max(ans,tr2.ask(val+n+m)+sb[rb[j]]+j);
		}
		cout<<ans<<endl;
	}
	return 0;
}