#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
const int inf=1e9+7;

static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(long long 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);}

int n,m,a[N],b[N],AS;
int la[N],ra[N],sa[N];
int lb[N],rb[N],sb[N];
int cla,clb,cra,crb;
int cl,cr;
int S;
struct BIT{
	int c[N<<1];
	void clr(int S){for(int i=1;i<=S;++i)c[i]=-inf;}
	void ad(int x,int k){while(x<=S) c[x]=max(c[x],k),x+=(x&(-x));}
	int ask(int x){int as=-inf;while(x) as=max(as,c[x]),x-=(x&(-x));return as;}
}T[2];

void solve(){
	n=wrd(),m=wrd(),cla=clb=cra=crb=0,AS=0;
	for(int i=1;i<=n;++i) a[i]=wrd(),la[i]=ra[i]=0;
	for(int i=1;i<=m;++i) b[i]=wrd(),lb[i]=rb[i]=0;
	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);
	for(int i=1;i<=n;++i) if(a[i]==1) la[++cla]=i;
	for(int i=1;i<=m;++i) if(b[i]==1) lb[++clb]=i;
	for(int i=n;i;--i) if(a[i]==3) ra[++cra]=i;
	for(int i=m;i;--i) if(b[i]==3) rb[++crb]=i;
	cl=min(cla,clb),cr=min(cra,crb);
	ra[0]=n+1,rb[0]=m+1,sa[n+1]=sa[n],sb[m+1]=sb[m];
	
	S=2*max(n,m)+1,T[0].clr(S),T[1].clr(S);
	
	for(int j=cr,i=-1;~j;--j){
		while(i+1<=cl && rb[j]>lb[i+1] && ra[j]>la[i+1]){
			++i;
			int ps=sa[la[i]]-sb[lb[i]];
			T[0].ad(m+1+ps,i-sb[lb[i]]); // check prefix
			T[1].ad(n+1-ps,i-sa[la[i]]); // check suffix
		}
	//	cout << i << ' '  << j << endl;
		int pos=sa[ra[j]-1]-sb[rb[j]-1];
		AS=max(AS,j+sb[rb[j]-1]+T[0].ask(m+1+pos));
		AS=max(AS,j+sa[ra[j]-1]+T[1].ask(n+1-pos));
	}
	write(AS),puts("");
}

signed main(){
	int T=wrd();
	while(T--) solve();
	return 0;
}