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

using ll = long long;
#define int ll
#define all(v) v.begin(),v.end()
#define pb push_back

void dbg_out() {cerr << endl; }
template< typename H, typename... T> 
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

struct kuhn {
	int n, m;
	vector<int> ml, mr;
	vector<bool> vis;
	vector<vector<int>> g;
	kuhn(int _n, int _m): n(_n), m(_m), ml(n, -1), mr(m, -1), vis(m), g(n) {}

	void add_edge(int u, int v) {
		g[u].pb(v);
	}

	bool dfs(int v) {
		for(int p: g[v]) {
			if(vis[p]) continue;
			vis[p] = 1;
			if(mr[p] == -1 || dfs(mr[p])) {
				ml[v] = p;
				mr[p] = v;
				return true;
			}
		}
		return false;
	}

	int matching() {
		int res = 0;
		bool t = 1;
		while(t) {
			t = false;
			fill(all(vis), false);
			for(int v=0;v<n;v++) if(ml[v] == -1) {
				if(dfs(v)) {
					res++;
					t = true;
				}
			}
		}
		return res;
	}
};

int m, n;

void solve () {
	cin >> m >> n;
	vector<array<int, 4>> t (m), d (n);
	for (auto &[x, y, xx, yy] : t) cin >> x >> y >> xx >> yy;
	for (auto &[x, y, xx, yy] : d) cin >> x >> y >> xx >> yy;

	map<pair<int, int>, vector<array<int, 3>> > M;
	for (int i = 0; i < n; i++) {
		auto [x, y, xx, yy] = d[i];
		M[{x, y}].pb ({xx, yy, i});
	}

	kuhn grafo (n, m);
	for (int i = 0; i < m; i++) {
		auto [x, y, xx, yy] = t[i];

		int area = (xx - x) * (yy - y);
		for (int a = x; a < xx; a++) {
			for (int b = y; b < yy; b++) {
				for (auto [aa, bb, id] : M[{a, b}]) {
					int l = min (aa, xx) - a, r = min (bb, yy) - b;
					if (l * r * 2 >= area) {
						grafo.add_edge (i, id);
					}
				}
			}
		}
	} 

	cout << grafo.matching () << "\n";
}

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