#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define MOD ((1ll << 31) - 1)
vector<array<int, 3>> pos[2010][2010];
vector<pair<int, int>> cls;

const int N = 100010;
const int INF = N * 10;
int s, t, ans;
int cnt, hed[N], to[N * 100], nxt[N * 100], val[N * 100];
int cur[N], dis[N], g[N];

void init(int n) {
    s = n + 1, t = n + 2, ans = 0;
    for(int i = 0; i <= t; i++) hed[i] = cur[i] = dis[i] = g[i] = 0;
    for(int i = 0; i <= cnt; i++) to[i] = val[i] = nxt[i] = 0;
    cnt = 1;
}
void addedge(int x, int y, int w) {
    // cout << ">>> " << x << " " << y << " " << w << "\n";
    to[++cnt] = y, nxt[cnt] = hed[x], hed[x] = cnt, val[cnt] = w;
    to[++cnt] = x, nxt[cnt] = hed[y], hed[y] = cnt, val[cnt] = 0;
}
int SAP(int u, int flow) {
    if(u == t) return flow;
    int v = flow;
    for(; cur[u]; cur[u] = nxt[cur[u]]) {
        if(dis[to[cur[u]]] == dis[u] - 1 && val[cur[u]]) {
            int f = SAP(to[cur[u]], min(v, val[cur[u]]));
            val[cur[u]] -= f, val[cur[u] ^ 1] += f;
            v -= f;
            if(!v) return flow;
        }
    }
    if(!--g[dis[u]++]) dis[s] = t + 1;
    ++g[dis[u]], cur[u] = hed[u]; return flow - v;
}
void Do() {
    int m, n;
    cin >> m >> n;
    init(n + m);
    for(int i = 1; i <= m; ++ i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        // cerr << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
        pos[x1][y1].push_back({x2, y2, i});
        cls.push_back({x1, y1});
    }
    for(int i = 1; i <= n; ++ i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        for(int x = max(x1 - 3, 0); x <= x2 - 1; ++ x) {
            for(int y = max(y1 - 3, 0); y <= y2 - 1; ++ y) {
                for(auto [x3, y3, id] : pos[x][y]) {
                    // cerr << x3 << " " << y3 << " " << id << endl;
                    // x y x3 y3
                    // x1 y1 x2 y2;
                    int X1 = max(x, x1), Y1 = max(y, y1);
                    int X2 = min(x3, x2), Y2 = min(y3, y2);
                    int S = (X2 - X1) * (Y2 - Y1);
                    if(X1 > X2 || Y1 > Y2) S = 0;
                    int pS = (x3 - x) * (y3 - y);
                    // cerr << pS << " " << S << endl;
                    if(S * 2 >= pS) {
                        // add edge id -> i + m
                        // cerr << id << " " << i + m << endl;
                        addedge(id, i + m, 1);
                    }
                }
            }
        }
    }
    // exit(0);

    for(int i = 1; i <= m; i++) addedge(s, i, 1);
    for(int i = 1; i <= n; i++) addedge(i + m, t, 1);
    for(int i = 1; i <= t; i++) cur[i] = hed[i];
    for(g[0] = t; dis[s] <= t; ans += SAP(s, INF));
    cout << ans << "\n";

    for(auto [x, y] : cls) {
        pos[x][y].clear();
    }
}
signed main() {
	// ios::sync_with_stdio(0);
    // cin.tie(0), cout.tie(0);
	int T;
    cin >> T;
    while(T --) {
        Do();
    }
}