#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
         << ": ";                                          \
    dbgh(__VA_ARGS__)
#else
#define cerr   \
    if (false) \
    cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

namespace kactl {
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
using ll = long;
using pii = pair<int, int>;
using vi = vector<int>;


struct Dinic {
    struct Edge {
        int to, rev;
        ll c, oc;
        ll flow() { return max(oc - c, long(0)); } // if you need flows
    };
    vi lvl, ptr, q;
    vector<vector<Edge>> adj;
    Dinic(int n) : lvl(n), ptr(n), q(n), adj(n) {}
    void addEdge(int a, int b, ll c, ll rcap = 0) {
        adj[a].push_back({b, sz(adj[b]), c, c});
        adj[b].push_back({a, sz(adj[a]) - 1, rcap, rcap});
    }
    ll dfs(int v, int t, ll f) {
        if (v == t || !f) return f;
        for (int& i = ptr[v]; i < sz(adj[v]); i++) {
            Edge& e = adj[v][i];
            if (lvl[e.to] == lvl[v] + 1)
                if (ll p = dfs(e.to, t, min(f, e.c))) {
                    e.c -= p, adj[e.to][e.rev].c += p;
                    return p;
                }
        }
        return 0;
    }
    ll calc(int s, int t) {
        ll flow = 0; q[0] = s;
        rep(L,0,31) do { // 'int L=30' maybe faster for random data
            lvl = ptr = vi(sz(q));
            int qi = 0, qe = lvl[s] = 1;
            while (qi < qe && !lvl[t]) {
                int v = q[qi++];
                for (Edge e : adj[v])
                    if (!lvl[e.to] && e.c >> (30 - L))
                        q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
            }
            while (ll p = dfs(s, t, LLONG_MAX)) flow += p;
        } while (lvl[t]);
        return flow;
    }
    bool leftOfMinCut(int a) { return lvl[a] != 0; }
};

#undef rep
#undef all
}  // namespace kactl

constexpr int maxa = 2005;

vector<array<int, 3>> arr[maxa][maxa];

void solve() {
    for (auto& a : arr) {
        for (auto& b : a) {
            b.clear();
        }
    }
    int n, q;
    cin >> q >> n;
    int queries[q][4];
    for (auto& [x1, y1, x2, y2] : queries) {
        cin >> x1 >> y1 >> x2 >> y2;
    }
    for (int i = 0; i < n; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        arr[x1][y1].push_back({x2, y2, i});
    }
    kactl::Dinic solver(n + q + 2);
    int src = n + q, sink = src + 1;
    for (int i = 0; i < n; i++) {
        solver.addEdge(src, i, 1);
    }
    for (int i = 0; i < q; i++) {
        solver.addEdge(n + i, sink, 1);
    }
    for (int i = 0; i < q; i++) {
        auto& [x1, y1, x2, y2] = queries[i];
        for (int x = max(x1 - 3, 0); x < x2; x++) {
            for (int y = max(y1 - 3, 0); y < y2; y++) {
                for (auto& [x3, y3, j] : arr[x][y]) {
                    int cx = min(x3, x2) - max(x, x1),
                        cy = min(y3, y2) - max(y, y1);
                    if (cx >= 0 && cy >= 0 &&
                        cx * cy * 2 >= (x2 - x1) * (y2 - y1)) {
                        solver.addEdge(j, n + i, 1);
                    }
                }
            }
        }
    }
    cout << solver.calc(src, sink) << endl;
}

int main() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
    int tcs;
    cin >> tcs;
    while (tcs--) {
        solve();
    }
}