#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size();
#define rep(i,j,k) for (int i = j; i < (k); i++)
#define in(mp, v) (mp.find(v) != mp.end())
#define smx(a, b) a = max(a, b)
#define smn(a, b) a = min(a, b)
#define pb push_back
#define endl '\n'

const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;

bool dfs(int a, int L, vector<vi> &g, vi& btoa, vi& A, vi &B) {
    if(A[a] != L) return 0;
    A[a] = -1;
    for(int b : g[a]) {
        if(B[b] == L+1) {
            B[b] = 0;
            if(btoa[b] == -1 || dfs(btoa[b], L+1, g, btoa, A,B)) {
                return btoa[b] = a, 1;
            }
        }
    }
    return 0;
}

int hopcroftKarp(vector<vi> &g, vi& btoa) {
    int res = 0;
    vi A(g.size()), B(btoa.size()), cur, next;
    for(;;) {
        fill(all(A), 0);
        fill(all(B), 0);
        cur.clear();
        for (int a : btoa) if(a != -1) A[a] = -1;
        for(int a = 0; a < g.size(); a++) {
            if(A[a] == 0) cur.pb(a);
        }
        for(int lay = 1;; lay++) {
            bool islast = 0;
            next.clear();
            for(int a : cur) for(int b : g[a]) {
                if(btoa[b] == -1) {
                    B[b] = lay;
                    islast = 1;
                } else if(btoa[b] != a && !B[b]) {
                    B[b] = lay;
                    next.pb(btoa[b]);
                }
            }
            if(islast) break;
            if(next.empty()) return res;
            for (int a : next) A[a] = lay;
            cur.swap(next);
        }
        for(int a = 0; a < g.size(); a++) {
            res += dfs(a, 0, g, btoa, A, B);
        }
    }
}

struct rect {
    int x1, y1, x2, y2, id;
};

rect inter(rect a, rect b) {
    return {max(a.x1, b.x1), max(a.y1, b.y1), min(a.x2, b.x2), min(a.y2, b.y2)};
}

int area(rect a) {
    if(a.y2 <= a.y1 || a.x2 <= a.x1) return 0;
    return (a.y2 - a.y1) * (a.x2 - a.x1);
}

void print(rect a) {
    cout << a.x1 << " " << a.y1 << " " << a.x2 << " " << a.y2 << endl;
}

void solve() {
    int n,m; cin >> n >> m;

    map<pii, vector<rect>> gt;
    for(int i = 0; i < n; i++) {
        rect a; 
        cin >> a.x1 >> a.y1 >> a.x2 >> a.y2;
        a.id = i;
        gt[{a.x1, a.y1}].pb(a);
    }

    vi btoa(n, -1);
    vector<vi> g(m);

    for(int i = 0; i < m; i++) {
        rect a; 
        cin >> a.x1 >> a.y1 >> a.x2 >> a.y2;
        for(int x = max(0, a.x1 - 3); x < a.x2; x++) {
            for(int y = max(0, a.y1 - 3); y < a.y2; y++) {
                if(gt.count({x,y}) == 0) continue;
                for(auto b : gt[{x,y}]) {
                 //   cout << area(inter(a,b)) << " " << area(b) << endl;
                //    print(inter(a,b));
                    if(area(inter(a,b)) * 2 >= area(b)) {
                        g[i].pb(b.id);
                    }
                }
            }
        }
    }

    // for(int i = 0; i < m; i++) {
    //     cout << i << ": ";
    //     for(auto x : g[i]) cout << x << " ";
    //     cout << endl;
    // }

   cout << hopcroftKarp(g, btoa) << endl;

}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int t; cin >> t;
    for(int tcase = 0; tcase < t; tcase++) {
        solve();
    }
}