#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

struct FlowEdge {
    int u, v;
    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 Rec_t {
    int x[2];
    int y[2];
    void input() {
        cin >> x[0] >> y[0] >> x[1] >> y[1];
        // cerr << x[0] << ' ' << y[0] << ' ' << x[1] << ' ' << y[1] << '\n';
    }
    int get_rec() {
        return (y[1] - y[0]) * (x[1] - x[0]);
    }
    friend int rec_intersect(Rec_t a, Rec_t b) {
        int u = max(a.y[0], b.y[0]);
        int d = min(a.y[1], b.y[1]);
        int l = max(a.x[0], b.x[0]);
        int r = min(a.x[1], b.x[1]);
        // cerr << u << ' ' << d << ' ' << l << ' ' << r << '\n';
        return (d - u) * (r - l);
    }
};

const int N = 50005;
const int M = 2002;
vector<int> p[M][M];
Rec_t a[N];
Rec_t b[N];

void run_case() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < M; j++) {
            p[i][j].clear();
        }
    }
    for (int i = 1; i <= n; i++) {
        a[i].input();
        // cerr << "##" << i << ": " << a[i].get_rec() << '\n';
    } 
    for (int i = 1; i <= m; i++) {
        b[i].input();
        for (int x = b[i].x[0]; x <= b[i].x[1]; x++) {
            for (int y = b[i].y[0]; y <= b[i].y[1]; y++) {
                p[x][y].push_back(i);
            }
        }
    }
    // cerr << rec_intersect(a[1], b[2]) << '\n';
    // return;
    int s = 0, t = n + m + 1;
    Dinic dinic(n + m + 3, s, t);
    for (int i = 1; i <= n; i++) {
        for (int x = a[i].x[0]; x <= a[i].x[1]; x++) {
            for (int y = a[i].y[0]; y <= a[i].y[1]; y++) {
                for (int j: p[x][y]) {
                    if (2 * rec_intersect(a[i], b[j]) >= a[i].get_rec()) {
                        // cerr << i << ' ' << j << '\n';
                        dinic.add_edge(i, j + n, 1);
                    }
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        dinic.add_edge(s, i, 1);
    }
    for (int i = 1; i <= m; i++) {
        dinic.add_edge(i + n, t, 1);
    }
    cout << dinic.flow() << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while (t --) {
        run_case();
    }
    return 0;
}