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

int read() {
	int x = 0, w = 1; char ch = 0;
	while (ch < '0' || ch > '9') { if (ch == '-') w = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + (ch - '0'); ch = getchar(); }
	return x * w;
}

const int N = 1e6 + 5;
int n, m, a[N], b[N], M;

struct BiTree {
	int c[N << 1];
	int lbt(int x) { return x & (-x); }
	void update(int x, int k) { for (x += M; x <= 2 * M; x += lbt(x)) c[x] = max(c[x], k); }
	int query(int x) { int a = INT_MIN; for (x += M; x; x -= lbt(x)) a = max(a, c[x]); return a; } 
} t1, t2;

int la[N], sa[N], ra[N], lb[N], sb[N], rb[N];
void solve() {
	n = read(); m = read(); M = max(n, m);
	for (int i = 1; i <= 2 * M; i++) t1.c[i] = t2.c[i] = INT_MIN;
	for (int i = 1; i <= n; i++) a[i] = read(), sa[i] = sa[i - 1] + (a[i] == 2), la[i] = n + 1, ra[i] = 0;
	for (int i = 1; i <= m; i++) b[i] = read(), sb[i] = sb[i - 1] + (b[i] == 2), lb[i] = m + 1, rb[i] = 0;
	la[0] = 0; for (int i = 1, ca = 0; i <= n; i++) if (a[i] == 1) la[++ca] = i;
	lb[0] = 0; for (int i = 1, cb = 0; i <= m; i++) if (b[i] == 1) lb[++cb] = i;
	ra[0] = n + 1; for (int i = n, ca = 0; i >= 1; i--) if (a[i] == 3) ra[++ca] = i;
	rb[0] = m + 1; for (int i = m, cb = 0; i >= 1; i--) if (b[i] == 3) rb[++cb] = i; 
	int ans = 0;
	for (int i = 0, j = min(n, m); j >= 0; j--) {
		for (; i <= min(n, m) && la[i] < ra[j] && lb[i] < rb[j]; i++) {
			t1.update(sa[la[i]] - sb[lb[i]], i - sb[lb[i]]); // 先把“变的东西”先放到 ds 上搞成区间关系 
			t2.update(sb[lb[i]] - sa[la[i]], i - sa[la[i]]); 
		}
		ans = max({ans, j + sb[rb[j] - 1] + t1.query(sa[ra[j] - 1] - sb[rb[j] - 1]), 
						j + sa[ra[j] - 1] + t2.query(sb[rb[j] - 1] - sa[ra[j] - 1])}); // 再利用大小关系把答案加上 
	}
	cout << ans << '\n'; 
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int T = read(); for (; T--; ) solve();
	return 0;
}