#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n,m,p,q;
int A[1000005],B[1000005],sum[2][1000005];

int tree[1000005];
#define lowbit(x) (x & (-x))
void upd(int pos,int C){//pos \in [0,n]
	pos = n + 1 - pos;
	while(pos <= n + 1){
		chkmax(tree[pos],C);
		pos += lowbit(pos);
	}
}
int qry(int pos){//>= pos query max
	pos = n + 1 - pos;
	chkmin(pos,n + 1);
	int ret = 0;
	while(pos){
		chkmax(ret,tree[pos]);
		pos -= lowbit(pos);
	}
	return ret;
}
int a[1000005],b[1000005],c[1000005],d[1000005];
int test(int i,int ans){
	return i + qry(ans + sum[0][a[i]] - i) - sum[1][c[i]] >= ans;
}

void solve(){
	scanf("%d%d",&n,&m);
	rep(i,1,n){
		scanf("%d",&A[i]);
		sum[0][i] = sum[0][i - 1] + (A[i] == 2);
	}
	rep(i,1,m){
		scanf("%d",&B[i]);
		sum[1][i] = sum[1][i - 1] + (B[i] == 2);
	}

	p = q = 0;
	int j1 = 1,j2 = 1;
	a[0] = c[0] = 0;
	rep(i,1,n){
		while(j1 <= n && A[j1] != 1) j1++;
		while(j2 <= m && B[j2] != 1) j2++;
		if(j1 > n || j2 > m) break;
		++p;
		a[p] = j1;c[p] = j2;
		j1++;j2++;
	}
	j1 = n;j2 = m;
	rep(i,1,n){
		while(j1 >= 1 && A[j1] != 3) j1--;
		while(j2 >= 1 && B[j2] != 3) j2--;
		if(!j1 || !j2) break;
		++q;
		b[q] = j1;d[q] = j2;
		j1--;j2--;
	}
	b[0] = n + 1;d[0] = m + 1;

/*	printf("(a,c)\n");
	rep(i,0,p) printf("%d %d\n",a[i],c[i]);
	printf("(b,d)\n");
	rep(i,0,q) printf("%d %d\n",b[i],d[i]);*/
	fill(tree,tree + n + 2,-inf);
	int answer = 0;
	int j = -1;
	per(i,p,0){
		while(j + 1 <= q && b[j + 1] >= a[i] && d[j + 1] >= c[i]){
			j++;
			upd(j + sum[0][b[j] - 1],j + sum[1][d[j] - 1]);
		}
		while(test(i,answer + 1)) answer++;
	}
	printf("%d\n",answer);
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}