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

#define x1 lqceopqiwecm
#define x2 poqwiecqweco
#define y1 qpwoeicmpoiq
#define y2 weopcmrqvoiu

#define rep(i,a,b) for (int i=(a); i<(b); ++i)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;

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;
		rep(a,0,sz(g)) if (A[a] == 0) cur.push_back(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.push_back(btoa[b]);
				}
			}
			if (islast) break;
			if (next.empty()) return res;
			for (int a : next) A[a] = lay;
			cur.swap(next);
		}
		rep(a,0,sz(g))
			res += dfs(a, 0, g, btoa, A, B);
	}
}

const int maxx = 2003, maxd = 4;

void solve() {
	int m, n;
	cin >> m >> n;
	vector<pair<pair<int, int>, pair<int, int>>> ra(m), rb(n);
	for (int i=0; i<m; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		ra[i] = {{x1, y1}, {x2, y2}};
	}
	for (int i=0; i<n; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		rb[i] = {{x1, y1}, {x2, y2}};
	}
	
	vector<vector<vector<int>>> who(maxx, vector<vector<int>>(maxx));
	for (int i=0; i<m; i++) {
		auto [p1, p2] = ra[i];
		auto [x1, y1] = p1;
		auto [x2, y2] = p2;
		// for (int x=x1; x<=x2; x++) {
		// 	for (int y=y1; y<=y2; y++) {
		// 		who[x][y].push_back(i);
		// 	}
		// }
		who[x1][y1].push_back(i);
	}
	vector<vi> g(n);
	for (int i=0; i<n; i++) {
		auto [p1, p2] = rb[i];
		auto [x1, y1] = p1;
		auto [x2, y2] = p2;
		int l = max(0, x1 - maxd), r = min(maxx - 1, x2);
		int d = max(0, y1 - maxd), u = min(maxx - 1, y2);
		set<int> cands;
		for (int x=l; x<=r; x++) {
			for (int y=d; y<=u; y++) {
				for (int j : who[x][y]) cands.insert(j);
			}
		}

		for (int j : cands) {
			auto [p3, p4] = ra[j];
			auto [x3, y3] = p3;
			auto [x4, y4] = p4;
			int mxl = max(x1, x3), mnr = min(x2, x4);
			int mxd = max(y1, y3), mnu = min(y2, y4);
			int iarea = (mnr - mxl) * (mnu - mxd);
			int barea = (x4 - x3) * (y4 - y3);
			if (mxl <= mnr && mxd <= mnu &&  iarea * 2 >= barea) {
				// cout << "tebel " << i << " tipis " << j << '\n';
				// cout << "isect: " << mxl << ' ' << mxd << ' ' << mnr << ' ' << mnu << ' ' << iarea << '\n';
				// cout << "tebel: " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
				// cout << "tipis: " << x3 << ' ' << y3 << ' ' << x4 << ' ' << y4 << ' ' << barea << '\n';
				g[i].push_back(j);
			}
		}
	}

	vi btoa(m, -1); 
	int ans = hopcroftKarp(g, btoa);
	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int tcs;
	cin >> tcs;
	while (tcs--) {
		solve();
	}
	return 0;
}