#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e6 + 5;
int n, m, a[maxn], b[maxn];
int suma[maxn], sumb[maxn];
int la[maxn], ra[maxn], lb[maxn], rb[maxn];
int tree1[maxn], tree2[maxn];

int lowbit(int x) {return x & (-x);}

void update(int a[], int x, int val)
{
	x += max(n, m);
	for(int i = x; i <= 2 * max(n, m); i += lowbit(i)) a[i] = max(val, a[i]);
}

int query(int a[], int x)
{
	x += max(n, m);
	int sum = -1e9;
	for(int i = x; i; i -= lowbit(i)) sum = max(a[i], sum);
	return sum;
}

void solve()
{
	cin >> n >> m;
	la[0] = lb[0] = 0; ra[0] = n + 1, rb[0] = m + 1;
	for(int i = 1; i <= 2 * max(n, m); i++)
	{
		tree1[i] = tree2[i] = -1e9;
	}
	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 <= 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);
	for(int i = 1; i <= n; ++i) la[i] = n + 1, ra[i] = 0;
	for(int i = 1; i <= m; ++i) lb[i] = m + 1, rb[i] = 0;
	for(int i = 1, j = 0; i <= n; i++) if(a[i] == 1) la[++j] = i;
	for(int i = 1, j = 0; i <= m; i++) if(b[i] == 1) lb[++j] = i;
	for(int i = n, j = 0; i >= 1; i--) if(a[i] == 3) ra[++j] = i;
	for(int i = m, j = 0; i >= 1; i--) if(b[i] == 3) rb[++j] = i;
	int ans = 0;
	for(int j = min(n, m), i = 0; j >= 0; j--)
	{
		while(i <= min(n, m) && ra[j] > la[i] && rb[j] > lb[i])
		{
			update(tree1, suma[la[i]] - sumb[lb[i]], i - sumb[lb[i]]);
			update(tree2, sumb[lb[i]] - suma[la[i]], i - suma[la[i]]);
			i++;
		}
//		cout << query(tree1, suma[ra[j] - 1] - sumb[rb[j] - 1]) << " " << query(tree2, sumb[rb[j] - 1] - suma[ra[j] - 1]) << '\n';
		ans = max(ans, j + sumb[rb[j] - 1] + query(tree1, suma[ra[j] - 1] - sumb[rb[j] - 1]));
		ans = max(ans, j + suma[ra[j] - 1] + query(tree2, sumb[rb[j] - 1] - suma[ra[j] - 1]));
	}
	cout << ans << '\n';
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t;
	cin >> t;
	while(t--) solve();
	
	return 0;
}