#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#define EPS 1e-9
#define PI acos(-1.0)
#define ll long long
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define pb push_back
#define ft first
#define sc second
#define pi pair<ll,ll>
#define vi vector<ll>
#define sz(s) s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll N = 2e5+5, M = 250, MOD = (1LL<<32), INF = 1e18;
int dx[] = {-1, 1, 0, 0}, Dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};;
int dy[] = {0, 0, 1, -1}, Dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll n, m, t, a[N];
map<pair<set<int>,set<int>>,int> ans;

void solve(int cnt,set<int>r,set<int>c)
{
    if(cnt == 5){
        ans[{r,c}]++;
        return;
    }
    set<int> R = r, C = c;
    solve(cnt+1,R,C);
    R.insert((cnt-1)/2);
    C.insert((cnt-1)%2);
    solve(cnt+1,R,C);
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);//freopen("lines.in", "r", stdin);
    solve(0,{},{});
    cin >> t;
    while(t--)
    {
        cin >> n >> m;
        set<int> r,c;
        for(int i = 0,rr; i < n ;++i) {
            cin >> rr;
            r.insert(rr);
        }
        for(int i = 0,rr; i < m ;++i) {
            cin >> rr;
            c.insert(rr);
        }
        cout << ans[{r,c}] << '\n';
    }

    return 0;
}
/*

*/