#include<bits/stdc++.h>
#define N 1000010
#define lb(i) i&(-i)
using namespace std;
int T,n,m,cnta,cntb,ccnta,ccntb,ans,a[N],b[N],La[N],Lb[N],Ra[N],Rb[N],suma[N],sumb[N],t[2][N];
void add(int p,int c,int opt){
    for(int i=p;i<=(opt?m:n);i+=lb(i))
        t[opt][i]=max(t[opt][i],c);
}
int query(int p,int opt){
    if(p==0)return 0;
    int ans=-0x3f3f3f3f;
    for(int i=p;i;i-=lb(i))
        ans=max(ans,t[opt][i]);
    return ans;
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        cnta=cntb=ccnta=ccntb=0,ans=-0x3f3f3f3f;
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]==1)La[++cnta]=i;
            suma[i]=suma[i-1]+(a[i]==2);
        }
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
            if(b[i]==1)Lb[++cntb]=i;
            sumb[i]=sumb[i-1]+(b[i]==2);
        }
        for(int i=n;i>=1;i--)if(a[i]==3)Ra[++ccnta]=i;
        for(int i=m;i>=1;i--)if(b[i]==3)Rb[++ccntb]=i;
        Ra[0]=n+1,Rb[0]=m+1;
        memset(t,-0x3f3f3f3f,sizeof(t));
        for(int i=1;i<=cnta;i++)add(i,i-suma[La[i]],0);
        for(int i=1;i<=cntb;i++)add(i,i-sumb[Lb[i]],1);
        for(int i=min(cnta,cntb),j=0;j<=min(ccnta,ccntb);j++){
            while(i&&(La[i]>=Ra[j]||Lb[i]>=Rb[j]))i--;
            int ma=suma[Ra[j]-1]+query(i,0),mb=sumb[Rb[j]-1]+query(i,1);
            ans=max(ans,j+min(ma,mb));
        }
        printf("%d\n",ans);
    }
}