#include<bits/stdc++.h>
#define int long long
#define _int __int128
#define y1 _
using namespace std;

static char buf[1000000],*p1=buf,*p2=buf;

inline int read(){
	char c=getchar();
	int res=0,f=1;
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		res=res*10+c-'0';
		c=getchar();
	}
	return res*f;
}

inline void write(int x){
	static char buf[20];
	static int len=-1;
	if(x<0){
		putchar('-');
		x=-x;
	}
	do{
		buf[++len]=x%10;
		x/=10;
	}
	while(x);
	while(len>=0){
		putchar(buf[len--]+48);
	}
}

const int maxn=1000005;
const int maxm=510;
const int inf=1e18;
const int bas=100;
const int mod=1e9+7;
const double eps=1e-4;

int a[maxn],b[maxn],sa[maxn],sb[maxn];
int la[maxn],ra[maxn],lb[maxn],rb[maxn];
int mn,mx,t1[maxn<<1],t2[maxn<<1];

int lowbit(int x){
	return x&-x;
}

void clear(){
	for(int i=1;i<=mx;i++){
		t1[i]=-inf;
		t2[i]=-inf;
	}
}

void update1(int x,int v){
	x=mx-x;
	for(int i=x;i<=mx;i+=lowbit(i)){
		t1[i]=max(t1[i],v);
	}
}

void update2(int x,int v){
	for(int i=x;i<=mx;i+=lowbit(i)){
		t2[i]=max(t2[i],v);
	}
}

int query1(int val){
	val=mx-val;
	int ans=-inf;
	for(int i=val;i;i-=lowbit(i)){
		ans=max(ans,t1[i]);
	}
	return ans;
}

int query2(int val){
	val--;
	if(!val){
		return -inf;
	}
	int ans=-inf;
	for(int i=val;i;i-=lowbit(i)){
		ans=max(ans,t2[i]);
	}
	return ans;
}

void solve(){
	int n=read(),m=read();
	mn=inf;mx=0;
	for(int i=1;i<=n;i++){
		a[i]=read();
		sa[i]=sa[i-1]+(a[i]==2);
	}
	for(int i=1;i<=m;i++){
		b[i]=read();
		sb[i]=sb[i-1]+(b[i]==2);
	}
	int ca1=0,ca3=0,cb1=0,cb3=0;
	for(int i=1;i<=n;i++){
		if(a[i]==1){
			la[++ca1]=i;
		}
	}
	for(int i=n;i;i--){
		if(a[i]==3){
			ra[++ca3]=i;
		}
	}
	for(int i=1;i<=m;i++){
		if(b[i]==1){
			lb[++cb1]=i;
		}
	}
	for(int i=m;i;i--){
		if(b[i]==3){
			rb[++cb3]=i;
		}
	}
	ra[0]=n+1,rb[0]=m+1;sa[n+1]=sa[n],sb[m+1]=sb[m];
	int ans=0;
	for(int i=0;i<=min(ca1,cb1);i++){
		mn=min(mn,sa[la[i]]-sb[lb[i]]);
		mx=max(mx,sa[la[i]]-sb[lb[i]]);
	}
	for(int i=0;i<=min(cb3,ca3);i++){
		mn=min(sa[ra[i]]-sb[rb[i]],mn);
		mx=max(sa[ra[i]]-sb[rb[i]],mx);
	}
	mn--;
	mx-=mn-1;
	clear();
	
	for(int j=min(cb3,ca3),i=-1;j>=0;j--){
		while(i+1<=min(ca1,cb1)&&la[i+1]<ra[j]&&lb[i+1]<rb[j]){
			i++;
			update1(sa[la[i]]-sb[lb[i]]-mn,i-sa[la[i]]);
			update2(sa[la[i]]-sb[lb[i]]-mn,i-sb[lb[i]]);
		}
		ans=max({ans,j+sa[ra[j]]+query1(sa[ra[j]]-sb[rb[j]]-mn),j+sb[rb[j]]+query2(sa[ra[j]]-sb[rb[j]]-mn)});
	}
	write(ans);
	puts("");
	return ;
}

signed main(){
	//	freopen("puxi.in","r",stdin);
	//	freopen("puxi.out","w",stdout);
	int T=1;
	T=read();
	while(T--){
		solve();
	}
	return 0;
}