#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10, dt = 1e6;
int a[N], b[N], la[N], ra[N], lb[N], rb[N], sa[N], sb[N];

struct BIT {
  int t[N * 2], n;

  void set(int _n) {
    n = _n;
  }

  void add(int x, int v) {
    for (; x <= n; x += x & -x) t[x] = max(t[x], v);
  }

  void clear(int x) {
    for (; x <= n; x += x & -x) t[x] = 0;
  }

  int ask(int x) {
    int ans = 0;
    for (; x; x -= x & -x) ans = max(ans, t[x]);
    return ans;
  }
} ta, tb;

void solve() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  a[n + 1] = b[m + 1] = 0;
  for (int i = 1; i <= n + 1; i++) sa[i] = sa[i - 1] + (a[i] == 2);
  for (int i = 1; i <= m + 1; i++) sb[i] = sb[i - 1] + (b[i] == 2);
  fill(la + 1, la + n + 1, n + 1);
  int cnt = 0;
  for (int i = 1; i <= n; i++) if (a[i] == 1) la[++cnt] = i;
  fill(ra + 1, ra + n + 1, 0);
  ra[0] = n + 1;
  cnt = 0;
  for (int i = n; i >= 1; i--) if (a[i] == 3) ra[++cnt] = i;
  fill(lb + 1, lb + m + 1, m + 1);
  cnt = 0;
  for (int i = 1; i <= m; i++) if (b[i] == 1) lb[++cnt] = i;
  fill(rb + 1, rb + m + 1, 0);
  rb[0] = m + 1;
  cnt = 0;
  for (int i = m; i >= 1; i--) if (b[i] == 3) rb[++cnt] = i;
  vector<int> orga, orgb;
  ta.set(max(n, m) + dt + 3);
  tb.set(max(n, m) + dt + 3);
  int ans = 0;
  for (int i = min(n, m), j = 0; i >= 0; i--) {
    if (la[i] == n + 1 || lb[i] == m + 1) continue;
    while (j <= min(n, m) && ra[j] > la[i] && rb[j] > lb[i]) {
      ta.add(sa[ra[j]] - sb[rb[j]] + dt, j + sa[ra[j]]);
      tb.add(sb[rb[j]] - sa[ra[j]] + dt, j + sb[rb[j]]);
      orga.emplace_back(sa[ra[j]] - sb[rb[j]] + dt);
      orgb.emplace_back(sb[rb[j]] - sa[ra[j]] + dt);
      j++;
    }
    ans = max(ans, i + max(ta.ask(sa[max(0, la[i] - 1)] - sb[max(0, lb[i] - 1)] + dt) - sa[max(0, la[i] - 1)], 
                            tb.ask(sb[max(0, lb[i] - 1)] - sa[max(0, la[i] - 1)] + dt) - sb[max(0, lb[i] - 1)]));
  }
  for (int p : orga) ta.clear(p);
  for (int p : orgb) tb.clear(p);
  vector<int>().swap(orga);
  vector<int>().swap(orgb); 
  cout << ans << '\n';
}

int main() {
  // freopen("A.in", "r", stdin);
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}