#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int N = 2e5 + 1009;
const int M = 8 * N * 40 + N;
int n, m;
namespace Dinic{
    const int inf = 0x3f3f3f3f;
    int s, t,  d[N], cpy[N], head[N], nexts[M], edge[M], ver[M], cnt = 1;
    void add(int x, int y, int z) {
        ver[++ cnt] = y, nexts[cnt] = head[x], head[x] = cpy[x] = cnt, edge[cnt] = z;
    }
    void clear() {
        for(int i = 1; i <= t; i ++) head[i] = cpy[i] = 0;
        cnt = 1;
    }
    bool bfs() {
        memset(d, 0, sizeof(d));
        queue<int> q;
        q.push(s);  d[s] = 1;
        while(!q.empty()) {
            int x = q.front(); q.pop();
            for(int i = head[x]; i; i = nexts[i]) {
                int v = ver[i], w = edge[i];
                if(w > 0 && !d[v]) d[v] = d[x] + 1, q.push(v);
            }
        }
        if(!d[t]) return false;
        return true;
    }
    int dfs(int x, int flow) {
        if(x == t || flow == 0) return flow;
        int maxflow = 0, f;
        for(int &i = head[x]; i; i = nexts[i]) {
            int v = ver[i], w = edge[i];
            if(d[v] == d[x] + 1 && w) {
                f = dfs(v, min(flow, w));
                if(f > 0) {
                    edge[i] -= f;
                    edge[i ^ 1] += f;
                    flow -= f; maxflow += f;
                    if(!flow) return maxflow;
                }
            }
        }
        return maxflow;
    }
    int dinic() {
        int maxflow = 0, flow;
        while(bfs()) {
            maxflow += dfs(s, inf);
            for(int i = 1; i <= t; i ++)
                head[i] = cpy[i];
        }
        return maxflow;
    }
}
vector<int> ver[2005][2005], Ver[2005][2005];
int xx[50005], yy[50005], xxx[50005], yyy[50005];
int XX[50005], YY[50005], XXX[50005], YYY[50005];
void work() {
    cin >> n >> m;
    Dinic::clear();
    Dinic::s = n + m + 1;
    Dinic::t = n + m + 2;
    for(int i = 0; i <= 2000; i ++)
        for(int j = 0; j <= 2000; j ++)
            ver[i][j].clear(), Ver[i][j].clear();

    for(int i = 1; i <= n; i ++) {
        cin >> xx[i] >> yy[i] >> xxx[i] >> yyy[i];
        for(int I = xx[i]; I <= xxx[i]; I ++) {
            for(int J = yy[i]; J <= yyy[i]; J ++) {
                ver[I][J].push_back(i);
            }
        }
        Dinic::add(i + m, Dinic::t, 1); Dinic::add(Dinic::t, i + m, 0);
    }

    for(int i = 1; i <= m; i ++) {
        cin >> XX[i] >> YY[i] >> XXX[i] >> YYY[i];
        Dinic::add(Dinic::s, i, 1); Dinic::add(i, Dinic::s, 0);
    }
    for(int i = 1; i <= m; i ++) {
        map<int,int> vis;
        int x = XX[i], y = YY[i], X = XXX[i], Y = YYY[i];
        auto check = [&](int id) {

            int lx = xx[id], ly = yy[id];
            int rx = xxx[id], ry = yyy[id];
            int s = (rx - lx) * (ry - ly);

            if(lx < x) lx = x;
            if(rx > X) rx = X;
            if(ly < y) ly = y;
            if(ry > Y) ry = Y;
            if(rx - lx <= 0) return false;
            if(ry - ly <= 0) return false;
            int ss = (rx - lx) * (ry - ly);

            return ss * 2 >= s;
        };
        for(int I = x; I <= X; I ++) {
            for(int J = y; J <= Y; J ++) {
                for(auto id : ver[I][J]) {
                    if(check(id)) {
                        if(vis[id]) continue;
                        vis[id] = 1;
                        Dinic::add(i, id + m, 1);
                        Dinic::add(id + m, i, 0);
                    }
                }
            }
        }
    }
    cout << Dinic::dinic() << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int Case;
    cin >> Case;
    while(Case --) work();
    return 0;
}