#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2000 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

struct FlowEdge {
    int v, u;
    long long cap, flow = 0;
    FlowEdge(int v, int u, long long cap) : v(v), u(u), cap(cap) {}
};

struct Dinic {
    const long long flow_inf = 1e18;
    vector<FlowEdge> edges;
    vector<vector<int>> adj;
    int n, m = 0;
    int s, t;
    vector<int> level, ptr;
    queue<int> q;

    Dinic(int n, int s, int t) : n(n), s(s), t(t) {
        adj.resize(n);
        level.resize(n);
        ptr.resize(n);
    }

    void add_edge(int v, int u, long long cap) {
        edges.emplace_back(v, u, cap);
        edges.emplace_back(u, v, 0);
        adj[v].push_back(m);
        adj[u].push_back(m + 1);
        m += 2;
    }

    bool bfs() {
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int id : adj[v]) {
                if (edges[id].cap - edges[id].flow < 1)
                    continue;
                if (level[edges[id].u] != -1)
                    continue;
                level[edges[id].u] = level[v] + 1;
                q.push(edges[id].u);
            }
        }
        return level[t] != -1;
    }

    long long dfs(int v, long long pushed) {
        if (pushed == 0)
            return 0;
        if (v == t)
            return pushed;
        for (int& cid = ptr[v]; cid < (int)adj[v].size(); cid++) {
            int id = adj[v][cid];
            int u = edges[id].u;
            if (level[v] + 1 != level[u] || edges[id].cap - edges[id].flow < 1)
                continue;
            long long tr = dfs(u, min(pushed, edges[id].cap - edges[id].flow));
            if (tr == 0)
                continue;
            edges[id].flow += tr;
            edges[id ^ 1].flow -= tr;
            return tr;
        }
        return 0;
    }

    long long flow() {
        long long f = 0;
        while (true) {
            fill(level.begin(), level.end(), -1);
            level[s] = 0;
            q.push(s);
            if (!bfs())
                break;
            fill(ptr.begin(), ptr.end(), 0);
            while (long long pushed = dfs(s, flow_inf)) {
                f += pushed;
            }
        }
        return f;
    }
};
struct Rectangle {
    int x1, y1, x2, y2, idx;
    Rectangle(int x1, int y1, int x2, int y2, int idx) : x1(x1), x2(x2), y1(y1), y2(y2), idx(idx) {}
    int area(){
        return max(0, x2 - x1) *  max(0, y2 - y1);
    }
};

Rectangle intersection(Rectangle a, Rectangle b){
    Rectangle c(0, 0, 0, 0, 0);
    c.x1 = max(a.x1, b.x1);
    c.x2 = min(a.x2, b.x2);
    c.y1 = max(a.y1, b.y1);
    c.y2 = min(a.y2, b.y2);
    return c;
}
vector<Rectangle> s[N][N];


void solve(){
    int m, n;
    cin >> m >> n;

    
    Dinic d(n + m + 2, n + m, n + m + 1);
    for(int i = 0; i < m; i++){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        s[x1][y1].emplace_back(x1, y1, x2, y2, i);
        d.add_edge(n + m, i, 1);
    }
    for(int i = 0; i < n; i++){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        for(int j = max(0, x1 - 4); j <= x1 + 4; j++){
            for(int k = max(0, y1 - 4); k <= y1 + 4; k++){
                for(auto x : s[j][k]){
                    if(intersection(Rectangle(x1, y1, x2, y2, i), x).area() * 2 >= x.area()){
                        d.add_edge(x.idx, i + m, 1);
                    }
                }
            }
        }
        d.add_edge(i + m, n + m + 1, 1);
    }
    cout << d.flow() << '\n';

    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            s[i][j].clear();
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}