# include <bits/stdc++.h>
# define rep(i, j, k) for(int i = j; i <= k; ++i)
# define per(i, j, k) for(int i = j; i >= k; --i)
# define go(u) for(int i = head[u], v; v = to[i], w = W[i], i; i = nxt[i])
# define maxn 100100
using namespace std;

int T, n, m, ans, c1, c3;
int a[maxn], b[maxn], la[maxn], ra[maxn], lb[maxn], rb[maxn], suma[maxn], sumb[maxn], cnt[2][4];
int pos[maxn];

namespace BIT {
    # define f(x) (x + maxn)
    # define lowbit(x) (x & -x)
    int Max[2][maxn << 3];
    set<pair<bool, int> > Furina;
    inline void update(int pos, int x, int t) {
        Furina.insert({t, pos}); bool flag = t == 1;
        while(pos <= f(min(n, m))) {
            Max[t][pos] = max(Max[t][pos], x);
            // cerr << "updateing " << t << ' ' << pos << ' ' << Max[t][pos] << '\n';
            pos += lowbit(pos);
        }
    }
    inline void clear(int pos, int t) {while(pos <= f(min(n, m))) Max[t][pos] = -0x3f3f3f3f, pos += lowbit(pos);}
    inline int query(int pos, int t) {
        int Max1 = -2e9; bool flag = pos - maxn == 1 && t == 1;
        while(pos) Max1 = max(Max1, Max[t][pos]), pos -= lowbit(pos);
        return Max1;
    }
    inline void init() {for(auto i = Furina.begin(); i != Furina.end(); ++i) clear(i -> second, i -> first); Furina.clear();}
} using namespace BIT;

signed main(){
    // freopen("sequence.in", "r", stdin);
    // freopen("sequence.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> T; memset(Max, -0x3f, sizeof(Max));
    while(T--) {
        cin >> n >> m; init(); ans = 0; memset(cnt, 0, sizeof(cnt));
        rep(i, 1, n) {
            cin >> a[i]; suma[i] = suma[i - 1] + (a[i] == 2);
            if(a[i] == 1) la[++cnt[0][1]] = i;
        }
        rep(i, 1, m) {
            cin >> b[i]; sumb[i] = sumb[i - 1] + (b[i] == 2);
            if(b[i] == 1) lb[++cnt[1][1]] = i;
        }
        per(i, n, 1) if(a[i] == 3) ra[++cnt[0][3]] = i;
        per(i, m, 1) if(b[i] == 3) rb[++cnt[1][3]] = i;
        c1 = min(cnt[0][1], cnt[1][1]), c3 = min(cnt[0][3], cnt[1][3]); ra[0] = n + 1, rb[0] = m + 1;
        // cout << c1 << ' ' << c3 << '\n';
        // rep(i, 1, c1) cout << la[i] << ' ' << lb[i] << '\n'; cout << '\n';
        // rep(i, 1, c3) cout << ra[i] << ' ' << rb[i] << '\n'; cout << '\n';
        // rep(i, 1, n) cout << suma[i] << ' '; cout << '\n';
        // rep(i, 1, m) cout << sumb[i] << ' '; cout << '\n';
        for(int i = c1, j = 0; j <= c3; ++j) {while(la[i] >= ra[j] || lb[i] >= rb[j]) i--; pos[j] = i;} pos[c3 + 1] = -1;
        per(j, c3, 0) {
            rep(i, pos[j + 1] + 1, pos[j]) {
                update(f(suma[la[i]] - sumb[lb[i]]), i - sumb[lb[i]], 0);
                update(f(sumb[lb[i]] - suma[la[i]]), i - suma[la[i]], 1);
                // cout << "update" << i << ' ' << -(sumb[lb[i]] - suma[la[i]]) << ' ' << i - sumb[lb[i]] << '\n';
                // cout << "update" << i << ' ' << -(suma[la[i]] - sumb[lb[i]]) << ' ' << i - suma[la[i]] << '\n';
            }
            ans = max(ans, query(f(suma[ra[j] - 1] - sumb[rb[j] - 1]), 0) + j + sumb[rb[j] - 1]);
            ans = max(ans, query(f(sumb[rb[j] - 1] - suma[ra[j] - 1]), 1) + j + suma[ra[j] - 1]);
            // cout << "query" << j << ' ' << suma[ra[j] - 1] - sumb[rb[j] - 1] << ' ' << query(f(suma[ra[j] - 1] - sumb[rb[j] - 1]), 0) << '\n';
            // cout << "query" << j << ' ' << suma[ra[j] - 1] - sumb[rb[j] - 1] << ' ' << query(f(sumb[rb[j] - 1] - suma[ra[j] - 1]), 1) << '\n';
        }
        cout << ans << '\n';
    }
    return 0;
}