#include <cstdio>
#include <vector>
#include <algorithm>

using i64 = long long;

const int N = 1e6 + 5;

int n, m;
int a[N], b[N];
int sa[N];
int sb[N];
void solve() {
	scanf("%d %d", &n, &m);

	for (int i = 1; i <= n; i++) {
		scanf("%d", a + i);
	}

	for (int i = 1; i <= m; i++) {
		scanf("%d", b + i);
	}

	std::vector<int> la, ra, lb, rb;
	la.push_back(n), ra.push_back(n), lb.push_back(m), rb.push_back(m);

	for (int i = 1; i <= n; i++) {
		if (a[i] == 1) {
			la.push_back(i);
		}
		sa[i] = sa[i - 1] + (a[i] == 2);
	}

	for (int i = n; i >= 1; i--) {
		if (a[i] == 3) {
			ra.push_back(i);
		}
	}

	for (int i = 1; i <= m; i++) {
		if (b[i] == 1) {
			lb.push_back(i);
		}
		sb[i] = sb[i - 1] + (b[i] == 2);
	}

	for (int i = m; i >= 1; i--) {
		if (b[i] == 3) {
			rb.push_back(i);
		}
	}
	
	int ans = std::min(sa[n], sb[m]);
	for (int i = 0; i < std::min((int)la.size(), (int)lb.size()); i++) {
		for (int j = 0; j < std::min((int)ra.size(), (int)rb.size()); j++) {
			ans = std::max(ans, i + j + std::min(sa[ra[j]] - sa[la[j]], sb[rb[j]] - sb[lb[j]]));
		}
	}

	printf("%d\n", ans);
}

int main() {
	int T; scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}