#include<iostream>
#include<cstring>
#define int long long
using namespace std;
const int N=3e6+5,inf=6e5;
int n,m,a[N],b[N],la[N],lb[N],sa[N],sb[N],ra[N],rb[N];
int mmax;
struct BIT{
	int s[N];
	void clear(){for(int i=0;i<=mmax;i++) s[i]=-inf;}
	int lowbit(int x){return x&-x;}
	void updata(int x,int v){x+=max(n,m);for(int i=x;i<=mmax;i+=lowbit(i)) s[i]=max(s[i],v);}
	int ask(int x){x+=max(n,m);int ans=-inf;for(int i=x;i>=1;i-=lowbit(i)) ans=max(ans,s[i]);return ans;}
}tree1,tree2;
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=m;i++) cin>>b[i];
	la[0]=lb[0]=0,ra[0]=n+1,rb[0]=m+1;
	for(int i=1;i<=n+1;i++) la[i]=n+1,ra[i]=0;
	for(int i=1;i<=m+1;i++) lb[i]=m+1,rb[i]=0;
	mmax=max(n,m)*2,tree1.clear(),tree2.clear();
	int p1=0,p2=0;
	for(int i=1;i<=n;i++) if(a[i]==1) la[++p1]=i;
	for(int i=n;i>=1;i--) if(a[i]==3) ra[++p2]=i;
	for(int i=1;i<=n;i++) sa[i]=sa[i-1]+(a[i]==2);
	p1=0,p2=0;
	for(int i=1;i<=m;i++) if(b[i]==1) lb[++p1]=i;
	for(int i=m;i>=1;i--) if(b[i]==3) rb[++p2]=i;
	for(int i=1;i<=m;i++) sb[i]=sb[i-1]+(b[i]==2);
	int ans=0;
	for(int i=0,j=min(n,m);j>=0;j--){
		while(i<=min(n,m)&&la[i]<ra[j]&&lb[i]<rb[j]){
			tree1.updata(sa[la[i]]-sb[lb[i]],i-sb[lb[i]]);
			tree2.updata(sb[lb[i]]-sa[la[i]],i-sa[la[i]]);
			i++;
		}
		ans=max(ans,j+max(sb[rb[j]-1]+tree1.ask(sa[ra[j]-1]-sb[rb[j]-1]),sa[ra[j]-1]+tree2.ask(sb[rb[j]-1]-sa[ra[j]-1])));
	}
	cout<<ans+1-1<<'\n';
}
signed main(){
	int T;cin>>T;
	while(T--) solve();
	return 0;
}