#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
#define ll long long
#define pb push_back
#define lowbit(i) (i&-i)
int n,m,lim,a[N],b[N],Sa[N],Sb[N],La[N],Lb[N],Ra[N],Rb[N];
int ta[5],tb[5],Fl[N],Fr[N];
struct Sgt{
	int val[N*4];
	void build(int l,int r,int u){
		val[u] = 0;
		if(l==r) return ;
		int mid = (l+r)>>1;
		build(l,mid,u*2),build(mid+1,r,u*2+1);
	} 
	void add(int l,int r,int u,int p,int w){
		if(l==r){
			val[u] = max(val[u],w);
			return ;
		}
		int mid = (l+r)>>1;
		if(p<=mid) add(l,mid,u*2,p,w);
		else add(mid+1,r,u*2+1,p,w);
		val[u] = max(val[u*2],val[u*2+1]);
	} 
	int ask(int l,int r,int u,int sl,int sr){
		if(sl>r || l>sr) return 0;
		if(sl<=l && r<=sr) return val[u];
		int mid = (l+r)>>1;
		return max(ask(l,mid,u*2,sl,sr),ask(mid+1,r,u*2+1,sl,sr));
	}
}s[2]; 
void solve(){
	cin >> n >> m;
	lim = max(n,m);
	for(int i=0;i<=lim+1;i++) a[i] = b[i] = Sa[i] = Sb[i] = La[i] = Lb[i] = Ra[i] = Rb[i] = Fl[i] = Fr[i] = 0;
	for(int i=0;i<=3;i++) ta[i] = tb[i] = 0;
	for(int i=1;i<=n;i++) cin >> a[i];
	for(int i=1;i<=m;i++) cin >> b[i];
	for(int i=1;i<=lim+1;i++){
		Sa[i] = Sa[i-1]+(a[i]==2);
		Sb[i] = Sb[i-1]+(b[i]==2);
		ta[a[i]]++,tb[b[i]]++;
		if(a[i]==1) La[ta[1]] = i;
		if(b[i]==1) Lb[tb[1]] = i;
	}
	for(int i=lim,a3=0,b3=0;i>=1;i--){
		if(a[i]==3) a3++,Ra[a3] = i;
		if(b[i]==3) b3++,Rb[b3] = i;
	}
	La[0] = Lb[0] = 0,Ra[0] = n+1,Rb[0] = m+1;
	for(int i=0;i<=lim;i++) Fl[i] = Sa[La[i]]-Sb[Lb[i]],Fr[i] = Sa[Ra[i]]-Sb[Rb[i]];
	vector<int> vec;
	for(int i=0;i<=lim;i++) vec.pb(Fl[i]),vec.pb(Fr[i]);
	sort(vec.begin(),vec.end()),vec.erase(unique(vec.begin(),vec.end()),vec.end());
	for(int i=0;i<=lim;i++) Fl[i] = lower_bound(vec.begin(),vec.end(),Fl[i])-vec.begin()+1,Fr[i] = lower_bound(vec.begin(),vec.end(),Fr[i])-vec.begin()+1;
	int L = vec.size(); s[0].build(1,L,1),s[1].build(1,L,1);
	int ans = 0;
	for(int i=min(ta[1],tb[1]),j=0;i>=0;i--){
//		cout << Fr[j] << "\n";
		while(j<=min(ta[3],tb[3]) && La[i]<Ra[j] && Lb[i]<Rb[j]) s[0].add(1,L,1,Fr[j],j+Sa[Ra[j]]),s[1].add(1,L,1,Fr[j],j+Sb[Rb[j]]),j++;
//		cout << Fl[i] << ' ' << Fr[j-1] << ' ' << j << ' ' << s[0].ask(1,L,1,1,Fl[i]) << ' ' << i-Sb[Lb[i]]+s[1].ask(1,L,1,Fl[i]+1,L) << "\n"; 
		ans = max(ans,max(i-Sa[La[i]]+s[0].ask(1,L,1,1,Fl[i]),i-Sb[Lb[i]]+s[1].ask(1,L,1,Fl[i]+1,L)));
	}
	cout << ans << '\n';
}
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	int T;cin >> T;
	while(T--) solve();
	return 0;
}