#include<bits/stdc++.h>
using namespace std;
namespace Read{
    #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
    char buf[1<<21],*p1=buf,*p2=buf;
    const int OUT=20;
    static char outp[OUT];
    int out;
    template<typename T>inline void read(T& t){
        int c=getchar(),f=1;t=0;
        while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
        while(isdigit(c))t=t*10+c-48,c=getchar();t*=f;
    }
    template<typename T,typename ...Args>inline void read(T& t,Args&... args){
        read(t),read(args...);
    }
    inline void write(short x){out=0; x<0&&(x=-x,putchar('-'));if(!x){ putchar(48); return; }while(x) outp[++out]=x%10+48,x/=10;while(out) putchar(outp[out--]);}
    inline void write(signed x){out=0; x<0&&(x=-x,putchar('-'));if(!x){ putchar(48); return; }while(x) outp[++out]=x%10+48,x/=10;while(out) putchar(outp[out--]);}
    inline void write(long long x){out=0; x<0&&(x=-x,putchar('-'));if(!x){ putchar(48); return; }while(x) outp[++out]=x%10+48,x/=10;while(out) putchar(outp[out--]);}
    inline void write(char x){putchar(x);}
    inline void write(const char* x){while(*x)putchar(*x++);}
    template<typename T,typename ...Args>inline void write(T t,Args ...args){
        write(t);write(args...);
    }
}
using namespace Read;
const int MAXN=1e6+5;
int n,m,a[MAXN],b[MAXN];
int La[MAXN],Ra[MAXN],suma[MAXN];
int Lb[MAXN],Rb[MAXN],sumb[MAXN];
int cnta1,cnta3,cntb1,cntb3;
int ans;
struct BIT1{
    int tr[MAXN<<1];
    #define lb(x) (x&(-x))
    inline void clear(){for(int i=0;i<=n+m+1;i++)tr[i]=-1e9;}
    inline void update(int x,int k){while(x){tr[x]=max(tr[x],k);x-=lb(x);}}
    inline int query(int x){int cnt=-1e9;while(x<=n+m+1){cnt=max(cnt,tr[x]);x+=lb(x);}return cnt;}
}tr1;
struct BIT2{
    int tr[MAXN<<1];
    #define lb(x) (x&(-x))
    inline void clear(){for(int i=0;i<=n+m+1;i++)tr[i]=-1e9;}
    inline void update(int x,int k){while(x<=n+m+1){tr[x]=max(tr[x],k);x+=lb(x);}}
    inline int query(int x){int cnt=-1e9;while(x){cnt=max(cnt,tr[x]);x-=lb(x);}return cnt;}
}tr2;
inline void solve(){
    cnta1=cnta3=cntb1=cntb3=ans=0;
    read(n,m);
    for(int i=1;i<=n;i++)read(a[i]);
    for(int i=1;i<=m;i++)read(b[i]);
    for(int i=1;i<=n;i++)if(a[i]==1)La[++cnta1]=i;
    for(int i=1;i<=m;i++)if(b[i]==1)Lb[++cntb1]=i;
    Ra[0]=n+1;for(int i=n;i>=1;i--)if(a[i]==3)Ra[++cnta3]=i;
    Rb[0]=m+1;for(int i=m;i>=1;i--)if(b[i]==3)Rb[++cntb3]=i;
    for(int i=1;i<=n;i++)suma[i]=suma[i-1]+(a[i]==2);
    for(int i=1;i<=m;i++)sumb[i]=sumb[i-1]+(b[i]==2);
    tr1.clear(),tr2.clear();
    int pos=0;
    for(int i=min(cnta3,cntb3);i>=0;i--){
        while(pos<=min(cnta1,cntb1)&&La[pos]<=Ra[i]&&Lb[pos]<=Rb[i]){
            tr1.update(suma[La[pos]]-sumb[Lb[pos]]+m+1,pos-suma[La[pos]]);
            tr2.update(suma[La[pos]]-sumb[Lb[pos]]+m+1,pos-sumb[Lb[pos]]);
            pos++;
        }
        ans=max(ans,i+tr1.query(suma[Ra[i]-1]-sumb[Rb[i]-1]+m+1)+suma[Ra[i]-1]);
        ans=max(ans,i+tr2.query(suma[Ra[i]-1]-sumb[Rb[i]-1]+m+1)+sumb[Rb[i]-1]);
    }
    write(ans,'\n');
}
signed main(){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int T;read(T);while(T--)solve();
}