#include<bits/stdc++.h>
using namespace std;
const int N = 50005;
const int inf = 1e9;
struct dinic{
    int s, t;
    int n;
    void init(int _n, int t1, int t2){
        s = t1, t = t2;  n = _n;
        for(int i = 0; i < n; i++){
            node[i].clear();
        }
        edge.clear();
    }
    struct Edge{
        int to, cap, flow;
    };
    vector<Edge>edge;
    vector<int> node[N << 1];
    int cur[N << 1], dep[N << 1];

    void add(int g, int h, int c){
        node[g].push_back(edge.size());
        edge.push_back({h, c, 0});
        node[h].push_back(edge.size());
        edge.push_back({g, 0, 0});
    }
    bool bfs(){
        queue<int> now;
        int vis[n + 1] = {0};
        for(int i = 0; i < n; i++){
            cur[i] = 0;
            dep[i] = 0;
        }
        now.push(s);
        vis[s] = 1;
        dep[s] = 1;
        while(now.size()){
            int tt = now.front();
            now.pop();
            for(int &i = cur[tt]; i < node[tt].size(); i++){
                int t1 = edge[node[tt][i]].to;
                int t2 = edge[node[tt][i]].cap;
                int t3 = edge[node[tt][i]].flow;
                if(!vis[t1] && t2 > t3){
                    dep[t1] = dep[tt] + 1;
                    vis[t1] = 1;
                    now.push(t1);
                }
            }
        }
        return vis[t];
    }
    int dfs(int v, int tot){

        if(v == t || tot == 0) return tot;
        int ff = 0;
        for(int &i = cur[v]; i < node[v].size(); i++){
            int t1 = edge[node[v][i]].to;
            int t2 = edge[node[v][i]].cap;
            int t3 = edge[node[v][i]].flow;
            if(t2 > t3 && dep[t1] == dep[v] + 1){
                int g = dfs(t1, min(tot - ff, t2 - t3));
                ff += g;
                edge[node[v][i]].flow += g;
                edge[node[v][i] ^ 1].flow -= g;
                if(ff == tot)
                    return ff;
            }
        }
        if(ff == 0)
            dep[v] = 0;
        
        return ff;
    }
    int flow(){
        int ans = 0;
        while(bfs()){
            for(int i = 0; i < n; i++){
                cur[i] = 0;
            }
            ans += dfs(s, inf);
        }
        return ans;
    }
}din;
int x1[N << 1], yy1[N << 1], x2[N << 1], y2[N << 1];
vector<int> have[2005][2005];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        for(int i = 0; i <= 2000; i++){
            for(int j = 0; j <= 2000; j++){
                have[i][j].clear();
            }
        }

        int n, m;
        cin >> n >> m;
        din.init(n + m + 2, 0, n + m + 1);
        for(int i = 1; i <= n; i++){
            cin >> x1[i] >> yy1[i] >> x2[i] >> y2[i];
        }
        for(int i = n + 1; i <= n + m; i++){
            cin >> x1[i] >> yy1[i] >> x2[i] >> y2[i];
        }
        for(int i = n + 1; i <= n + m; i++){
            din.add(i, n + m + 1, 1);
            for(int j = x1[i]; j < x2[i]; j++){
                for(int k = yy1[i]; k < y2[i]; k++){
                    have[j][k].push_back(i);
                }
            }
        }
        for(int i = 1; i <= n; i++){
            din.add(0, i, 1);
            map<int, int> cnt;
            for(int j = x1[i]; j < x2[i]; j++){
                for(int k = yy1[i]; k < y2[i]; k++){
                    for(auto p : have[j][k]){
                        cnt[p] += 1;
                    }
                }
            }
            for(auto p : cnt){
                if(p.second * 2 >= (x2[i] - x1[i]) * (y2[i] - yy1[i])){
                    din.add(i, p.first, 1);
                }
            }
        }
        cout << din.flow() << '\n';
    }
}