#include <bits/stdc++.h>
#define db double
#define pii pair<int, int>
#define ls (p << 1)
#define rs (p << 1 | 1)
using namespace std;

const int N = 1e6 + 5;
int n, m, a[N], b[N], La[N], Lb[N], Ra[N], Rb[N], suma[N], sumb[N], of, num;

struct BIT {
    int mx[N << 3];
    void clear() {
        for (int i = 1; i <= 3 * max(n, m) + 2; ++i) mx[i] = -1e9;
        // memset(mx, -0x3f, sizeof mx);'
    }
    void add(int x, int v) {
        x += of;
        for (; x < 3 * max(n, m) + 2; x += x & -x) mx[x] = max(mx[x], v);
    }
    int ask(int x) {
        x += of;
        int res = -1e9;
        for (; x; x -= x & -x) res = max(mx[x], res);
        return res;
    }
} T1, T2;

int T;

void solve() {
    ++num;
    cin >> n >> m;
    of = 2 * max(n, m) + 1;
    T1.clear(), T2.clear();
    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 <= max(n, m); ++i) La[i] = Lb[i] = max(n , m) + 1, Ra[i] = Rb[i] = 0;
    int cnt = 0; for (int i = 1; i <= n; ++i) if (a[i] == 1) La[++cnt] = i;
    cnt = 0; for (int i = 1; i <= m; ++i) if (b[i] == 1) Lb[++cnt] = i;
    Ra[0] = n + 1, cnt = 0; for (int i = n; i; --i) if (a[i] == 3) Ra[++cnt] = i;
    // cout << n + 1 << endl;
    Rb[0] = m + 1, cnt = 0; for (int i = m; i; --i) if (b[i] == 3) Rb[++cnt] = i;
    for (int i = 1; i <= n + 1; ++i) suma[i] = suma[i - 1] + (a[i] == 2);
    for (int i = 1; i <= m + 1; ++i) sumb[i] = sumb[i - 1] + (b[i] == 2); 
    int j = 0, ans = 0;
    for (int i = min(n, m); i >= 0; i --) {
        while (Ra[i] > La[j] && Rb[i] > Lb[j] && j <= min(n, m)) {
            T1.add(sumb[Lb[j]] - suma[La[j]], j - suma[La[j]]);
            T2.add(suma[La[j]] - sumb[Lb[j]], j - sumb[Lb[j]]);
            ++j;
        }
        ans = max(ans, i + max(suma[Ra[i] - 1] + T1.ask(sumb[Rb[i] - 1] - suma[Ra[i] - 1]), sumb[Rb[i] - 1] + T2.ask(suma[Ra[i] - 1] - sumb[Rb[i] - 1])));
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> T;
    while (T--) solve();
    
    return 0;
}