#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int T, n, m;
namespace HK {
	int n1, n2, m, cx[maxn], cy[maxn], dx[maxn], dy[maxn], vis[maxn], id[maxn];
	vector<pair<int, int> > e[maxn];
	int q[maxn], head, tail;

	void Init(int _n, int _m) {
		n1 = _n, n2 = _m, m = 0;
		for(int i = 1; i <= n1; ++ i)
			e[i].clear();
	}
	void Add(int u, int v) {
		e[u].push_back({v, ++ m});
	}
	int Match(int u) {
		for(auto edge : e[u]) {
			int v = edge.first;
			if(!vis[v] && dy[v] == dx[u] + 1) {
				vis[v] = 1;
				if(cy[v] == -1 || Match(cy[v])) {
					cx[u] = v;
					cy[v] = u;
					id[u] = edge.second;
					return 1;
				}
			}
		}
		return 0;
	}
	bool BFS() {
		for(int i = 1; i <= n1; ++ i)
			dx[i] = 0;
		for(int i = 1; i <= n2; ++ i)
			dy[i] = 0;
		head = 1, tail = 0;
		for(int i = 1; i <= n1; ++ i)
			if(cx[i] == -1) {
				q[++ tail] = i;
				dx[i] = 1;
			}
		bool flag = 0;
		while(head <= tail) {
			int u = q[head ++];
			for(auto edge : e[u]) {
				int v = edge.first;
				if(dy[v] == 0) {
					dy[v] = dx[u] + 1;
					if(cy[v] == -1) {
						flag = true;
					}
					else {
						dx[cy[v]] = dy[v] + 1;
						q[++ tail] = cy[v];
					}
				}
			}
		}
		return flag;
	}

	int Solve() {
		int ans = 0;
		for(int i = 1; i <= n1; ++ i)
			cx[i] = -1;
		for(int i = 1; i <= n2; ++ i)
			cy[i] = -1;
		while(BFS()) {
			for(int i = 1; i <= max(n1, n2); ++ i) {
				vis[i] = 0;
			}
			for(int i = 1; i <= n1; ++ i) {
				if(cx[i] == -1) {
					ans += Match(i);
				}
			}
		}
		return ans;
	}
}
int blx[maxn], brx[maxn], bly[maxn], bry[maxn];
int dlx[maxn], drx[maxn], dly[maxn], dry[maxn];
int area[maxn];
map<pair<int, int>, vector<int> > mpid;
int Check(int i, int j) {
	int lx = max(dlx[i], blx[j]);
	int rx = min(drx[i], brx[j]);
	int ly = max(dly[i], bly[j]);
	int ry = min(dry[i], bry[j]);
	if(lx >= rx)
		return 0;
	if(ly >= ry)
		return 0;
	return (rx - lx) * (ry - ly) * 2 >= area[j];
}
int main() {
	for(scanf("%d", &T); T --; ) {
		scanf("%d%d", &m, &n);
		HK :: Init(n, m);
		for(int i = 1; i <= m; ++ i) {
			scanf("%d%d%d%d", &blx[i], &bly[i], &brx[i], &bry[i]);
			if(blx[i] > brx[i])
				swap(blx[i], brx[i]);
			if(bly[i] > bry[i])
				swap(bly[i], bry[i]);
			mpid[{blx[i], bly[i]}].push_back(i);
			area[i] = (brx[i] - blx[i]) * (bry[i] - bly[i]);
		}
		for(int i = 1; i <= n; ++ i) {
			scanf("%d%d%d%d", &dlx[i], &dly[i], &drx[i], &dry[i]);
			if(dlx[i] > drx[i])
				swap(dlx[i], drx[i]);
			if(dly[i] > dry[i])
				swap(dly[i], dry[i]);
		}
		for(int i = 1; i <= n; ++ i) {
			for(int x = max(0, dlx[i] - 4); x <= drx[i]; ++ x) {
				for(int y = max(0, dly[i] - 4); y <= dry[i]; ++ y) {
					if(mpid.find({x, y}) == mpid.end())
						continue;
					for(auto j : mpid[{x, y}])
						if(Check(i, j))
							HK :: Add(i, j);
				}
			}
		}
		printf("%d\n", HK :: Solve());
	}
}