#include<bits/stdc++.h>
#define ri register int
#define fp(i, a, b) for(ri i = (a), ed = (b); i <= ed; ++i)
#define fb(i, a, b) for(ri i = (a), ed = (b); i >= ed; --i)
#define go(u, i) for(int i = head[u]; i; i = e[i].nxt)
using namespace std;

const int maxn = 100010, maxm = 2010;

int rd(){
	int f = 1, x = 0; char ch = getchar();
	while(ch > '9' || ch < '0'){ 	if(ch == '-')f = -1; ch = getchar(); }
	while(ch <= '9' && ch >= '0'){ x = (x << 1) + (x << 3) + (ch ^ 48);  ch = getchar(); }
	return x * f;
}

int T, m, n, lx[maxn], ly[maxn], rx[maxn], ry[maxn], mx, my;
int mat[maxn], vis[maxn], now;
vector<int> vec[maxm][maxm];
struct edge{int to, nxt;}e[maxn*100];
int head[maxn], k;
inline void add(int u, int v){e[++k] = (edge){v, head[u]}, head[u] = k;}
bool dfs(int u){
	vis[u] = now;
	go(u, i){
		if(!mat[e[i].to])return mat[u] = e[i].to, mat[e[i].to] = u, 1;
		if(vis[mat[e[i].to]] != now && dfs(mat[e[i].to]))return mat[u] = e[i].to, mat[e[i].to] = u, 1;
	}
	return 0;
}
int main(){
	T = rd();
	while(T--){
		m = rd(), n = rd();
		fp(i, 1, m+n)lx[i] = rd(), ly[i] = rd(), rx[i] = rd(), ry[i] = rd();
		mx = my = 0;
		fp(i, 1, m+n)mx = max(mx, rx[i]+4), my = max(my, ry[i]+4);
		fp(i, 0, mx)fp(j, 0, my)vec[i][j].clear();
		fp(i, m+1, m+n)vec[rx[i]][ry[i]].push_back(i);
		fp(i, 1, m+n)mat[i] = head[i] = vis[i] = 0;
		k = now = 0;
		fp(i, 1, m){
			fp(x, lx[i], rx[i]+4)fp(y, ly[i], ry[i]+4){
				for(auto &d : vec[x][y]){
					int nlx = max(lx[i], lx[d]), nly = max(ly[i], ly[d]);
					int nrx = min(rx[i], rx[d]), nry = min(ry[i], ry[d]);
					if(nlx >= nrx || nly >= nry)continue;
					if((nrx-nlx)*(nry-nly)*2 >= (rx[i]-lx[i])*(ry[i]-ly[i]))add(i, d);
				}
			}
		}
		int ans = 0;
		while(1){
			int cnt = 0;
			++now;
			fp(i, 1, m)if(!mat[i] && dfs(i))++cnt;
			if(!cnt)break;
			ans += cnt;
		}
		printf("%d\n", ans);
	}
}