#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

const int N = 1e6 + 10;
const int inf = 0x7fffffff;
int T, n, m, ans, Lcnta, Rcnta, Lcntb, Rcntb;
int a[N], b[N], suma[N], sumb[N];
int Ra[N], La[N], Lb[N], Rb[N]; 
int p[N], c[N], cnt;

int t1[N], t2[N];

int Get (int x) {
	return std::lower_bound (c + 1, c + cnt + 1, x) - c;
}

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

void modify1 (int x, int y) {
	for (int i = x; i <= cnt; i += lowbit (i))
		t1[i] = std::max(t1[i], y);
} 

void modify2 (int x, int y) {
	for (int i = x; i <= cnt; i += lowbit (i))
		t2[i] = std::max(t2[i], y);
} 

int query1 (int x) {
	int ans = -inf;
	for (int i = x; i; i -= lowbit (i))
		ans = std::max(ans, t1[i]);
	return ans;
}

int query2 (int x) {
	int ans = -inf;
	for (int i = x; i; i -= lowbit (i))
		ans = std::max(ans, t2[i]);
	return ans;
}

void clear () {
	for (int i = 1; i <= cnt; i++)
		t1[i] = t2[i] = -inf;
}

int main() {
	scanf("%d", &T);
	while (T--) {
		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]);
		for (int i = 1; i <= n; i++) {
			suma[i] = suma[i - 1];
			if (a[i] == 2) suma[i]++;
		}
		for (int i = 1; i <= m ; i++) {
			sumb[i] = sumb[i - 1];
			if (b[i] == 2) sumb[i]++;
		}
		Lcnta = Rcnta = Lcntb = Rcntb = 0;
		for (int i = 1; i <= n; i++) 
			if (a[i] == 1) La[++Lcnta] = i;
		for (int i = 1; i <= m; i++)
			if (b[i] == 1) Lb[++Lcntb] = i;
		for (int i = n; i >= 1; i--) 
			if (a[i] == 3) Ra[++Rcnta] = i;
		for (int i = m; i >= 1; i--)
			if (b[i] == 3) Rb[++Rcntb] = i;
		Ra[0] = n + 1; Rb[0] = m + 1; 
		suma[n + 1] = suma[n], sumb[m + 1] = sumb[m];
//		for (int i = 1; i <= n; i++) 
//			printf("%d %d %d\n", suma[i], La[i], Ra[i]);
//		printf("\n\n");
//		for (int i = 1; i <= m; i++) 
//			printf("%d %d %d\n", sumb[i], Lb[i], Rb[i]);
		cnt = 0;
		for (int i = 0; i <= std::min(Lcnta, Lcntb); i++)
			p[i] = suma[La[i]] - sumb[Lb[i]], c[++cnt] = p[i];
		for (int i = 0; i <= std::min(Rcnta, Rcntb); i++)
			c[++cnt] = suma[Ra[i]] - sumb[Rb[i]];
		
		clear(); ans = -inf;
		std::sort (c + 1, c + cnt + 1);
		cnt = std::unique (c + 1, c + cnt + 1) - c - 1;
		for (int j = std::min(Rcnta, Rcntb), i = -1; j >= 0; j--) {
			while (i + 1 <= std::min(Lcnta, Lcntb) && La[i + 1] < Ra[j] && Lb[i + 1] < Rb[j]) {
				i++;
				modify1 (cnt - Get(p[i]) + 1, i - suma[La[i]]);
				modify2 (Get(p[i]), i - sumb[Lb[i]]);
			}
			int now = suma[Ra[j]] - sumb[Rb[j]];
//			for (int k = 0; k <= i; k++) {
//				if (p[k] >= now) ans = std::max(ans, j + suma[Ra[j]] + k - suma[La[k]]);
//				if (p[k] <= now) ans = std::max(ans, j + sumb[Rb[j]] + k - sumb[Lb[k]]);
//			}
			ans = std::max(ans, j + suma[Ra[j]] + query1 (cnt - Get(now) + 1));
			ans = std::max(ans, j + sumb[Rb[j]] + query2 (Get(now)));
		}
		printf("%d\n", ans);
	}
	return 0;
}