#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N],b[N],sa[N],sb[N];
int la[N],ra[N],lb[N],rb[N];
int Min,Max,t1[N<<1],t2[N<<1];
void clear(){
    for(int i=1;i<=Max;i++)t1[i]=t2[i]=-1e9;
}
void upd1(int x,int v){
    x=Max-x;
    // cout<<x<<"\n";
    for(int i=x;i<=Max;i+=i&-i)t1[i]=max(t1[i],v);
}
void upd2(int x,int v){
    for(int i=x;i<=Max;i+=i&-i)t2[i]=max(t2[i],v);
}
int q1(int val){
    // cout<<val<<"\n";
    val=Max-val;
    int ans=-1e9;
    for(int i=val;i;i-=i&-i)ans=max(ans,t1[i]);
    return ans;
}
int q2(int val){
    val--;if(!val)return -1e9;
    int ans=-1e9;
    for(int i=val;i;i-=i&-i)ans=max(ans,t2[i]);
    return ans;
}
void solve(){
    int n,m;Min=1e9;Max=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),sa[i]=sa[i-1]+(a[i]==2);
    for(int i=1;i<=m;i++)scanf("%d",&b[i]),sb[i]=sb[i-1]+(b[i]==2);
    int ca1=0,ca3=0,cb1=0,cb3=0;
    for(int i=1;i<=n;i++)if(a[i]==1)la[++ca1]=i;
    for(int i=n;i;i--)if(a[i]==3)ra[++ca3]=i;
    for(int i=1;i<=m;i++)if(b[i]==1)lb[++cb1]=i;
    for(int i=m;i;i--)if(b[i]==3)rb[++cb3]=i;
    ra[0]=n+1,rb[0]=m+1;sa[n+1]=sa[n],sb[m+1]=sb[m];
    int ans=0;
    for(int i=0;i<=min(ca1,cb1);i++)Min=min(Min,sa[la[i]]-sb[lb[i]]),Max=max(Max,sa[la[i]]-sb[lb[i]]);
    for(int i=0;i<=min(cb3,ca3);i++)Min=min(sa[ra[i]]-sb[rb[i]],Min),Max=max(sa[ra[i]]-sb[rb[i]],Max);
    // cout<<Max<<" "<<Min<<"\n";
    Min--;
    Max-=Min-1;clear();
    
    for(int j=min(cb3,ca3),i=-1;j>=0;j--){
        while(i+1<=min(ca1,cb1)&&la[i+1]<ra[j]&&lb[i+1]<rb[j]){
            i++;
            upd1(sa[la[i]]-sb[lb[i]]-Min,i-sa[la[i]]);
            upd2(sa[la[i]]-sb[lb[i]]-Min,i-sb[lb[i]]);
        }
        // cout<<max(la[i+1],lb[i+1])<<" "<<min(ra[j],rb[j])<<"\n";
        // cout<<i<<" "<<j<<"\n";
        ans=max({ans,j+sa[ra[j]]+q1(sa[ra[j]]-sb[rb[j]]-Min),j+sb[rb[j]]+q2(sa[ra[j]]-sb[rb[j]]-Min)});
    }
    printf("%d\n",ans);
}
int main() {
    int t;
    scanf("%d",&t);
    while(t--)solve();
    return 0;
}