#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

#include <algorithm>
#include <cassert>
#include <queue>
#include <random>
#include <utility>
#include <vector>

struct BipartiteMatching {
    int U, V, t;
    bool solved;
    std::vector<std::vector<int>> G;
    std::vector<int> L, R, visited;

    BipartiteMatching(int U, int V) : U(U), V(V), t(0), solved(false), G(U), L(U, -1), R(V, -1), visited(U, -1) {}

    void add_edge(int u, int v) {
        assert(0 <= u && u < U);
        assert(0 <= v && v < V);
        G[u].emplace_back(v);
    }

    void shuffle() {
        static std::mt19937 mt;
        for (auto& v : G) std::shuffle(v.begin(), v.end(), mt);
    }

    int solve() {
        for (bool updated = true; std::exchange(updated, false); t++) {
            for (int i = 0; i < U; i++) {
                if (L[i] == -1) {
                    updated |= dfs(i);
                }
            }
        }
        solved = true;
        return U - std::count(L.begin(), L.end(), -1);
    }

    std::vector<std::pair<int, int>> max_matching() const {
        assert(solved);
        std::vector<std::pair<int, int>> res;
        for (int i = 0; i < U; i++) {
            if (~L[i]) {
                res.emplace_back(i, L[i]);
            }
        }
        return res;
    }

private:
    bool dfs(int u) {
        if (std::exchange(visited[u], t) == t) return false;
        for (int& v : G[u]) {
            if (R[v] == -1) {
                L[u] = v, R[v] = u;
                return true;
            }
        }
        for (int& v : G[u]) {
            if (dfs(R[v])) {
                L[u] = v, R[v] = u;
                return true;
            }
        }
        return false;
    }
};

struct rectangle {
    int lx, ly, rx, ry;
    rectangle(int lx, int ly, int rx, int ry) : lx(lx), ly(ly), rx(rx), ry(ry) {}
    int area() const { return (rx - lx) * (ry - ly); }
};

int intersection(const rectangle& l, const rectangle& r) {
    int lx = max(l.lx, r.lx), ly = max(l.ly, r.ly);
    int rx = min(l.rx, r.rx), ry = min(l.ry, r.ry);
    if (rx <= lx or ry <= ly) return 0;
    return (rx - lx) * (ry - ly);
}

const int MAX = 2010;
vector<int> idxs[MAX][MAX];

void solve() {
    int m, n;
    cin >> m >> n;
    vector<rectangle> L, R;
    for (int i = 0; i < m; i++) {
        int lx, ly, rx, ry;
        cin >> lx >> ly >> rx >> ry;
        L.emplace_back(lx, ly, rx, ry);
    }
    for (int i = 0; i < n; i++) {
        int lx, ly, rx, ry;
        cin >> lx >> ly >> rx >> ry;
        R.emplace_back(lx, ly, rx, ry);
    }

    auto move = [&]() {
        int mx = INF, my = INF;
        for (auto& rec : L) {
            chmin(mx, rec.lx);
            chmin(my, rec.ly);
        }
        for (auto& rec : R) {
            chmin(mx, rec.lx);
            chmin(my, rec.ly);
        }
        for (auto& rec : L) {
            rec.lx -= mx;
            rec.ly -= my;
            rec.rx -= mx;
            rec.ry -= my;
        }
        for (auto& rec : R) {
            rec.lx -= mx;
            rec.ly -= my;
            rec.rx -= mx;
            rec.ry -= my;
        }
    };
    auto rotate = [&]() {
        vector<rectangle> nL, nR;
        for (auto& rec : L) nL.emplace_back(-rec.ry, rec.lx, -rec.ly, rec.rx);
        for (auto& rec : R) nR.emplace_back(-rec.ry, rec.lx, -rec.ly, rec.rx);
        swap(L, nL);
        swap(R, nR);
    };
    BipartiteMatching BM(m, n);
    set<pair<int, int>> s;
    for (int _ = 0; _ < 4; _++) {
        move();
        for (int i = 0; i < n; i++) {
            auto& rec = R[i];
            idxs[rec.lx][rec.ly].emplace_back(i);
        }
        for (int i = 0; i < m; i++) {
            auto& rec = L[i];
            for (int x = rec.rx - 4; x < rec.rx; x++) {
                if (x < 0) continue;
                if ((rec.rx - x) * 2 < rec.rx - rec.lx) continue;
                for (int y = rec.ry - 4; y < rec.ry; y++) {
                    if (y < 0) continue;
                    if ((rec.rx - x) * (rec.ry - y) * 2 < rec.area()) continue;
                    for (int& j : idxs[x][y]) {
                        if (intersection(rec, R[j]) * 2 >= rec.area() and not s.count({i, j})) {
                            BM.add_edge(i, j);
                            s.emplace(i, j);
                        }
                    }
                }
            }
        }
        for (int i = 0; i < n; i++) {
            auto& rec = R[i];
            idxs[rec.lx][rec.ly].pop_back();
        }
        rotate();
    }

    int ans = BM.solve();
    cout << ans << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    for (; t--;) solve();
    return 0;
}