#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=3e6+10;
int n,m,a[N],b[N],na[N],nc[N],ma[N],mc[N],sum1[N],sum2[N];
struct Bitss{
	int c[N];
	void init(){
		for(int i=0;i<=2*(n+m);i++)c[i]=INT_MIN;
	}
	int lowbit(int l){
		return l&(-l);
	}
	void update(int pos,int k){
		pos+=n+m;
		pos=2*(n+m)-pos;
		for(int i=pos;i<N;i+=lowbit(i))c[i]=max(c[i],k);
	}
	int query(int pos){
		int res=INT_MIN;
		pos+=n+m;
		pos=2*(n+m)-pos;
		for(int i=pos;i;i-=lowbit(i))res=max(c[i],res);
		return res;
	}
}T1,T2;
signed main(){
        ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while(T--){
		cin>>n>>m;
		for(int i=1;i<=n;i++)cin>>a[i];
		for(int i=1;i<=m;i++)cin>>b[i];
		int cnt1=0,cnt2=0,tot1=0,tot2=0;
		for(int i=1;i<=n;i++){
			if(a[i]==1)na[++cnt1]=i;
			sum1[i]=sum1[i-1]+(a[i]==2);
		}
		for(int i=1;i<=m;i++){
			if(b[i]==1)ma[++cnt2]=i;
			sum2[i]=sum2[i-1]+(b[i]==2);
		}
		for(int i=n;i;i--){
			if(a[i]==3)nc[++tot1]=i;
		}
		for(int i=m;i;i--){
			if(b[i]==3)mc[++tot2]=i;
		}
		nc[0]=n+1;mc[0]=m+1;
		na[0]=ma[0]=0;
		T1.init(),T2.init();
		int ans=0;
		for(int j=min(tot1,tot2),i=0;j>=0;j--){
			while(i<=min(cnt1,cnt2)&&na[i]<nc[j]&&ma[i]<mc[j]){
				T1.update(sum1[na[i]]-sum2[ma[i]],i-sum1[na[i]]);
				T2.update(sum2[ma[i]]-sum1[na[i]],i-sum2[ma[i]]);
				i++;
			}
			ans=max(ans,j+max(sum1[nc[j]-1]+T1.query(sum1[nc[j]-1]-sum2[mc[j]-1]),sum2[mc[j]-1]+T2.query(sum2[mc[j]-1]-sum1[nc[j]-1])));
		}
		cout<<ans<<'\n';
	}
	return 0;
}