#include "bits/stdc++.h"
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
// #define int long long
 
#define dbg_loc() cerr << __PRETTY_FUNCTION__ << " : " << __LINE__ << "\n"
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p){ 
	return os << '(' << p.first << ", " << p.second << ')'; 
}
template<typename T_container,typename T=typename enable_if<!is_same<T_container,string>::value, typename T_container::value_type>::type> 
ostream& operator<<(ostream &os, const T_container &v){ 
	os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; 
}
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
	cerr << ' ' << H; 
	dbg_out(T...); 
}
#define LOCAL
#define LOCAL
#ifdef LOCAL 
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...)
#endif
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll mod = (1000000007LL);
inline ll Mod(ll a, ll b){return (a%b);}
inline ll poww(ll a, ll b){ll res = 1;while (b > 0){if(b & 1) res = (res * a)%mod;a = (a * a)%mod;b >>= 1;}return res;}
ll gcd (ll a, ll b) { while (b) { a %= b,swap(a, b);}return a;}
void read(vector<int> &w, int n){w.resize(n);for(int i = 0; i < n; i++) cin>>w[i];}
void print(vector<int> &w){for(int i =0; i < sz(w); i++){if(i == sz(w) - 1) cout<<w[i]<<"\n";else cout<<w[i]<<" ";}}
 
///CUIDADO COM MAXN
#define N 50010 // 1E6

int n, m;
int xi[2][N],yi[2][N], xii[2][N], yii[2][N];
// 0 =ground truth (m cells)
// 1 = guess (n cells)
map<pii, vi> caras;
bool valid(int guess, int truth){
	int Lx = max(xi[0][truth], xi[1][guess]);
	int Rx = min(xii[0][truth], xii[1][guess]);

	int Ly = max(yi[0][truth], yi[1][guess]);
	int Ry = min(yii[0][truth], yii[1][guess]);

	if(Lx > Rx or Ly > Ry) return false;

	int intersect = (Rx-Lx)*(Ry-Ly);
	int area = (xii[0][truth] - xi[0][truth])*(yii[0][truth] - yi[0][truth]);

	return 2*intersect >= area;
}
struct bipartite_match{ // 1 indice
	int n , m;
	vector<vi> g; vi vis , match;
	bipartite_match(int n , int m) : n(n) , m(m), vis(n+m+2) , match(n+m+2) , g(n+m+2){}
	void addLR(int x , int y){ // aresta da esquerda pra direita
		g[x].push_back(y + n);
		return ;
	}
	void addRL(int x , int y){ // aresta da direita pra esquerda
		g[x+n].push_back(y);
		return ;
	}
	bool dfs(int x){
		allin(w,g[x]){
			if(vis[w]) continue;
			vis[w] = true;
			if(match[w] == 0 || dfs(match[w])){
				match[w] = x, match[x] = w; 
				return true;
			}
		}
		return false;
	}
	int solve(){
		int ans = 0; bool haspath;
		do{
			haspath = false;
			fill(all(vis) , false);
			for(int i = 1 ; i<= n + m; i ++){
				if(!match[i] && dfs(i)) haspath = 1 , ans ++ ;
			}
		} while(haspath);
		return ans;
	}
	int matchL(int x){return (match[x] ? match[x] - n : 0);}
	int matchR(int x){return match[x+n];}
};
void solve_case(){
	cin>>m>>n;
	caras.clear();
	rep(i,1,m+1){
		cin>>xi[0][i]>>yi[0][i]>>xii[0][i]>>yii[0][i];
	}
	bipartite_match B(m+1, n+1);
	rep(i,1,n+1){
		cin>>xi[1][i]>>yi[1][i]>>xii[1][i]>>yii[1][i];
		auto T = mp(xi[1][i], yi[1][i]);
		caras[T].pb(i);
		T = mp(xii[1][i],yii[1][i]);
		caras[T].pb(i);
	}
	int ans =0;
	rep(i,1,m+1){
		int can=0;
		rep(dx, xi[0][i], xii[0][i] + 1){
			rep(dy, yi[0][i], yii[0][i] + 1){
				auto T = mp(dx, dy);
				for(auto p: caras[T]){
					if(valid(p, i)){
						B.addLR(i, p);
						B.addRL(p, i);
					}
				}
			}
		}
		// ans += can;
	}
	rep(i,1,m+n+2){
		shuffle(all(B.g[i]), rng);
	}
	// B.
	cout<<B.solve()<<"\n";
}
int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0);
	int test_case;
	cin>>test_case;
	while(test_case--){
		solve_case();
	}
}