#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll t,n,m,a[1000010],b[1000010],ans=0;
ll prea[1000010],cnta1=0,sufa[1000010],cnta3=0,suma[1000010];
ll preb[1000010],cntb1=0,sufb[1000010],cntb3=0,sumb[1000010];
struct BIT1{
	ll tree[2000020];
	il ll lowbit(ll x){
		return x&(-x);
	}
	il void init(){
		fr(i,0,n+m+1) tree[i]=-inf;
	}
	void mdf(ll x,ll v){
		while(x){
			tree[x]=max(tree[x],v);
			x-=lowbit(x);
		}
	}
	il ll query(ll x){
		ll res=-inf;
		while(x<=(n+m+1)){
			res=max(res,tree[x]);
			x+=lowbit(x);
		}
		return res;
	}
}T1;
struct BIT2{
	ll tree[2000020];
	il ll lowbit(ll x){
		return x&(-x);
	}
	il void init(){
		fr(i,0,n+m+1) tree[i]=-inf;
	}
	void mdf(ll x,ll v){
		while(x<=(n+m+1)){
			tree[x]=max(tree[x],v);
			x+=lowbit(x);
		}
	}
	il ll query(ll x){
		ll res=-inf;
		while(x){
			res=max(res,tree[x]);
			x-=lowbit(x);
		}
		return res;
	}
}T2;
void clr(){
	ans=cnta1=cntb1=cnta3=cntb3=0;
}
int main(){
	t=read();
	while(t--){
		n=read();
		m=read();
		fr(i,1,n) a[i]=read();
		fr(i,1,m) b[i]=read();
		fr(i,1,n) if(a[i]==1) prea[++cnta1]=i;
		fr(i,1,m) if(b[i]==1) preb[++cntb1]=i;
		sufa[0]=n+1;
		sufb[0]=m+1;
		pfr(i,n,1) if(a[i]==3) sufa[++cnta3]=i;
		pfr(i,m,1) if(b[i]==3) sufb[++cntb3]=i;
		fr(i,1,n) suma[i]=suma[i-1]+(a[i]==2);
		fr(i,1,m) sumb[i]=sumb[i-1]+(b[i]==2);
		T1.init();
		T2.init();
		ll pos=0;
		pfr(i,min(cnta3,cntb3),0){
			while(pos<=min(cnta1,cntb1)&&prea[pos]<=sufa[i]&&preb[pos]<=sufb[i]){
				T1.mdf(suma[prea[pos]]-sumb[preb[pos]]+m+1,pos-suma[prea[pos]]);
				T2.mdf(suma[prea[pos]]-sumb[preb[pos]]+m+1,pos-sumb[preb[pos]]);
				pos++;
			}
			ans=max(ans,i+T1.query(suma[sufa[i]-1]-sumb[sufb[i]-1]+m+1)+suma[sufa[i]-1]);
			ans=max(ans,i+T2.query(suma[sufa[i]-1]-sumb[sufb[i]-1]+m+1)+sumb[sufb[i]-1]);
		}
		writeln(ans);
		clr();
	}
}