#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 50005;
const int M = 2000;
std::vector<int> ia[M][M];
struct rg {
	int l, r;
	int L()const{ return std::max(r-l,0); }
};
int n, m;
int last[N];
rg un(rg x, rg y) { return {std::max(x.l, y.l), std::min(x.r, y.r)}; }
struct mat {
	rg x, y;
	int s()const{ return x.L()*y.L(); }
} a[N], b[N];
mat un(mat x, mat y){ return {un(x.x, y.x), un(x.y, y.y)}; }

std::vector<int> edge[N];
std::vector<int> L, R, vis, matchl, matchr;
bool bfs(int nl, int nr) {
	L.assign(nl + 1, 0);
	R.assign(nr + 1, 0);
	static std::queue<int> Q;
	for(int i = 1;i <= nl;++i) if(!matchl[i]) L[i] = 1, Q.push(i);
	int succ = 0;
	for(;Q.size();) {
		int x = Q.front(); Q.pop();
		for(int i : edge[x]) if(!R[i]) {
			R[i] = L[x] + 1;
			if(int p = matchr[i]) {
				L[p] = R[i] + 1, Q.push(p);
			} else {
				succ = 1;
			}
		}
	}
	return succ;
}
bool dfs(int x) {
	for(int i : edge[x]) if(R[i] == L[x] + 1 && !vis[i]) {
		vis[i] = 1;
		if(!matchr[i] || dfs(matchr[i])) {
			return matchl[x] = i, matchr[i] = x, 1;
		}
	}
	return 0;
}
int match(int nl, int nr) {
	matchl.assign(nl + 1, 0);
	matchr.assign(nr + 1, 0);
	vis.resize(nr + 1);
	for(;bfs(nl, nr);) {
		memset(vis.data(), 0, vis.size() << 2);
		for(int i = 1;i <= nl;++i) if(!matchl[i]) dfs(i);
	}
	return matchl.size() - count(matchl.begin(), matchl.end(), 0);
}
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	int t;
	cin >> t;
	for(int i = 0;i < t;++i) {
		cin >> n >> m;
		for(int i = 0;i < M;++i)
		for(int j = 0;j < M;++j)
			ia[i][j].clear();
		for(int i = 1;i <= n;++i) {
			cin >> a[i].x.l >> a[i].y.l;
			cin >> a[i].x.r >> a[i].y.r;
			for(int x = a[i].x.l;x < a[i].x.r;++x)
				for(int y = a[i].y.l;y < a[i].y.r;++y)
					ia[x][y].push_back(i);
			last[i] = 0;
			edge[i].clear();
		}
		for(int j = 1;j <= m;++j) {
			cin >> b[j].x.l >> b[j].y.l;
			cin >> b[j].x.r >> b[j].y.r;
			for(int x = b[j].x.l;x < b[j].x.r;++x)
				for(int y = b[j].y.l;y < b[j].y.r;++y) {
					for(int id : ia[x][y]) {
						if(last[id] == j) continue;
						if(un(a[id], b[j]).s() * 2 >= a[id].s()) {
							edge[id].push_back(j);
							last[id] = j;
						}
					}
				}
		}
		cout << match(n, m) << '\n';
	}
}