#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 5e6+7;
typedef long long ll;
#define int long long 
const int inf = 0x3f3f3f3f;
int n,m,s,t;
struct edge{
	int to,next,now,w;
}e[N];
int head[N],ecnt,d[N],vis[N],cur[N];
int dist[N];
void add(int u,int v,int w){
	e[ecnt] = {v,head[u],0,w};
	head[u] = ecnt++;
}
bool bfs(int s,int t){
	for(int i = 0;i<=2*t;i++) d[i] = vis[i] = 0;
	queue<int> q;
	q.push(s);
	vis[s] = 1;
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i = head[u];~i;i = e[i].next){
			int to = e[i].to,now = e[i].now,w = e[i].w;
			if(!vis[to]&&now < w){
				vis[to] = 1;
				d[to] = d[u] + 1;
				q.push(to);
				if(to == t) return 1;
			}
		}
	}
	return vis[t];
}
ll dfs(int u,int t,int imp){
	if(u == t || !imp) return imp;
	ll res = 0;
	for(int &i = cur[u];~i;i=e[i].next){
		int to = e[i].to;
		int now = e[i].now;
		if(d[u]+1!=d[to]) continue;
		int f = dfs(to,t,min(imp,e[i].w-now)) ;
		if(f==0) continue;
		e[i].now += f;
		e[i^1].now -= f;
		res += f;
		imp -= f;
		if(!imp) break; 
	}
	return res;
}
int k;
ll Dinic(int s,int t){
	ll flow = 0;
	while(bfs(s,t)){
		for(int i = 0;i<=k;i++){
			cur[i] = head[i]; 
		}
		flow += dfs(s,t,inf);
	}
	return flow;
}
int x[N],y[N],xx[N],yy[N];
vector<int> G[2100][2100];
int cal(int x,int y,int xx,int yy){
	return (yy-y)*(xx-x);
}
bool check(int x,int y,int xx,int yy,int a,int b,int c,int d){
	if(x==xx&&y==yy){
		return 0;
	}
	int mx = max(x,a);
	int my = max(y,b);
	int mxx = min(xx,c);
	int myy = min(yy,d);
	if(mxx<=mx||myy<=my) return 0;	
	return cal(mx,my,mxx,myy)*2 >= cal(x,y,xx,yy);
}
signed main(){
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	int T;
	cin>>T;
	while(T--){
		int num1,num2;
		cin>>num1>>num2;
		int tot = num1+num2;
		m = num2*40; 
		k = m;
		ecnt = 0;
		for(int i = 0;i<=m;i++){
			head[i] = -1;
		}
		int s = 0,t = tot + 1;
		for(int i = 1;i<=num1;i++){
			cin>>x[i]>>y[i]>>xx[i]>>yy[i];
			G[x[i]][y[i]].push_back(i);
		} 
		for(int i = num1+1;i<=num2+num1;i++){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			for(int j = max(a-2,0ll);j<=c;j++){
				for(int z = max(b-2,0ll);z<=d;z++){
					if(G[j][z].size()==0) continue;
					for(int ix : G[j][z]){
						if(check(x[ix],y[ix],xx[ix],yy[ix],a,b,c,d)){
							add(i,ix,1);
							add(ix,i,0);
						}
					}		
				}
			}
		}
		for(int i = 1;i<=num1;i++){
			add(i,t,1);
			add(t,i,0);
			G[x[i]][y[i]].clear();
		} 
		for(int i = num1+1;i<t;i++){
			add(s,i,1);
			add(i,s,0);
		}
		cout << Dinic(s,t) << '\n';
	}
	return 0;
}
//