#include<bits/stdc++.h>
// #define ONLINE_JUDGE
#define INPUT_DATA_TYPE int
#define OUTPUT_DATA_TYPE int
inline __attribute((always_inline)) INPUT_DATA_TYPE read(){register INPUT_DATA_TYPE x=0;register char f=0,c=getchar();while(c<'0'||'9'<c)f=(c=='-'),c=getchar();while('0'<=c&&c<='9')x=(x<<3)+(x<<1)+(c&15),c=getchar();return f?-x:x;}void print(OUTPUT_DATA_TYPE x){if(x<0)x=-x,putchar('-');if(x>9)print(x/10);putchar(x%10^48);return;}

#define BIT_DATA_TYPE int
const int BIT_SIZE=2000010;
struct BIT{
    BIT_DATA_TYPE tree[BIT_SIZE];
    int size;
    void build(register int datasize){
        size=datasize;
        for(register int i=1;i<=datasize;++i){
            tree[i]=-0x3f3f3f3f;
        }
        return;
    }
    BIT_DATA_TYPE getsum(register int l,register int r){return presum(r)-presum(l-1);}
    BIT_DATA_TYPE presum(register int pos){
        BIT_DATA_TYPE sum=-0x3f3f3f3f;
        while(pos) sum=std::max(sum,tree[pos]),pos-=lowbit(pos);
        return sum;
    }
    void add(register BIT_DATA_TYPE data,register int pos){while(pos<=size) tree[pos]=std::max(tree[pos],data),pos+=lowbit(pos);}
    inline int lowbit(BIT_DATA_TYPE x){return x&-x;}
    void clear(register int pos){while(pos<=size) tree[pos]=0,pos+=lowbit(pos);}
    void clear(){
        memset(this,0,sizeof(BIT));
        return;
    }
}bita,bitb;

int suma[1000010],sumb[1000010],a[1000010],b[1000010];

void solve(){
    std::vector<int> La,Ra,Lb,Rb;
    register int i,j,res=0,maxi,maxj;
    int n=read();
    int m=read();
    for(i=1;i<=n;++i){
        a[i]=read();
        if(a[i]==1) La.push_back(i);
        else if(a[i]==3) Ra.push_back(i);
        suma[i]=suma[i-1]+(a[i]==2);
    }
    for(i=1;i<=m;++i){
        b[i]=read();
        if(b[i]==1) Lb.push_back(i);
        else if(b[i]==3) Rb.push_back(i);
        sumb[i]=sumb[i-1]+(b[i]==2);
    }
    std::reverse(Ra.begin(),Ra.end());
    std::reverse(Rb.begin(),Rb.end());
    La.insert(La.begin(),0);
    Ra.insert(Ra.begin(),n+1);
    Lb.insert(Lb.begin(),0);
    Rb.insert(Rb.begin(),m+1);
    maxi=std::min({La.size(),Lb.size()})-1;
    maxj=std::min({Ra.size(),Rb.size()})-1;
    
    bita.build(n+m+1);
    bitb.build(n+m+1);

    // for(i=0;i<=maxi;++i)
    // for(j=0;j<=maxj;++j)
    // if(Ra[j]>La[i]&&Rb[j]>Lb[i]){
    //     res=std::max(res,i+j+std::min(suma[Ra[j]-1]-suma[La[i]],sumb[Rb[j]-1]-sumb[Lb[i]]));
    // }
    for(i=maxi,j=0;~i;--i){
        while(j<=maxj&&Ra[j]>La[i]&&Rb[j]>Lb[i]){
            bita.add(j+suma[Ra[j]-1],suma[Ra[j]-1]-sumb[Rb[j]-1]+m+1);
            bitb.add(j+sumb[Rb[j]-1],sumb[Rb[j]-1]-suma[Ra[j]-1]+n+1);
            ++j;
        }
        res=std::max({bita.presum(suma[La[i]]-sumb[Lb[i]]+m+1)+i-suma[La[i]],bitb.presum(sumb[Lb[i]]-suma[La[i]]+n+1)+i-sumb[Lb[i]],res});
    }
    print(res),putchar('\n');
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("name.in", "r", stdin);
	freopen("name.out", "w", stdout);
	#endif

    int T=read();
    while(T--) solve();

	#ifndef ONLINE_JUDGE
	fclose(stdin);
	fclose(stdout);
	#endif
    return 0;
}