#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int nmax = 2e3+2;

vector<int>bam[nmax][nmax];
vector<int>dan[nmax][nmax];

const int N = 5e4+5;
int X1[2][N], X2[2][N], Y1[2][N], Y2[2][N];

int interSecc(int L1, int R1, int L2, int R2){
    int L = max(L1, L2), R = min(R1, R2);
    if(L<=R) return R-L;
    return 0;
}

bool hasEdge(int i, int j){
    int aria = (X2[0][i] - X1[0][i]) * (Y2[0][i] - Y1[0][i]);
    int interAria = interSecc(X1[0][i], X2[0][i], X1[1][j], X2[1][j]) * interSecc(Y1[0][i], Y2[0][i], Y1[1][j], Y2[1][j]);
    if(interAria*2 >= aria){
        return true;
    }
    return false;
}

namespace HopcroftKarp { // 1-indexed. L,R indep
const int maxN=1e6+7,maxM=1e6+7; int n, m, match;
int vis[maxN], level[maxN], ml[maxN], mr[maxM];
vector<int> edge[maxN];
void init(int N, int M) { //N=left nodes, M = right
  n = N, m = M;
  for (int i=1;i<=n;i++) edge[i].clear(),ml[i]=-1;
  for (int i=1;i<=m;i++)  mr[i] = -1;
  match = 0;
}
void add(int u, int v) {
  edge[u].push_back(v);
  if(ml[u]==-1&&mr[v]==-1)ml[u]=v,mr[v]=u,match++;
}
bool dfs(int u) {
  vis[u] = true;
  for (int x: edge[u]) {
    int v = mr[x];
    if (v == -1 || (!vis[v]
              && level[u] < level[v] && dfs(v))) {
      ml[u] = x; mr[x] = u; return true;
    }
  }
  return false;
}
int matching() {
  while (true) {
    queue<int> q;
    for (int i = 1; i <= n; ++i) {
      if (ml[i] == -1)  level[i] = 0, q.push(i);
      else        level[i] = -1;
    }
    while (!q.empty()) {
      int u = q.front(); q.pop();
      for (int x: edge[u]) {
        int v = mr[x];
        if (v != -1 && level[v] < 0) {
          level[v] = level[u] + 1; q.push(v);
        }
      }
    }
    for (int i = 1; i <= n; ++i) vis[i] = false;
    int d = 0;
    for(int i=1;i<=n;++i)if(ml[i]==-1&&dfs(i))++d;
    if (d == 0) return match; match += d;
  }
} }

void solv(int ces){
    int m,n;
    cin>>m>>n;
    for(int i=1; i<=m; i++){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        X1[0][i] = x1;
        X2[0][i] = x2;
        Y1[0][i] = y1;
        Y2[0][i] = y2;

        for(int x=x1; x<=x2; x++){
            for(int y=y1; y<=y2; y++){
                bam[x][y].push_back(i);
            }
        }
    }

    for(int i=1; i<=n; i++){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        X1[1][i] = x1;
        X2[1][i] = x2;
        Y1[1][i] = y1;
        Y2[1][i] = y2;

        for(int x=x1; x<=x2; x++){
            for(int y=y1; y<=y2; y++){
                dan[x][y].push_back(i);
            }
        }
    }
    vector<pii>allP;
    for(int i=0; i<nmax; i++){
        for(int j=0; j<nmax; j++){
            for(int a : bam[i][j]){
                for(int b : dan[i][j]){
                    allP.emplace_back(a, b);
                }
            }
            bam[i][j].clear();
            dan[i][j].clear();
        }
    }
    sort(allP.begin(), allP.end());
    allP.erase(unique(allP.begin(), allP.end()), allP.end());

    HopcroftKarp::init(m, n);

    for(auto [i,j] : allP){
        if(hasEdge(i, j)){
            HopcroftKarp::add(i, j);
        }
    }

    cout<< HopcroftKarp::matching() <<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int tc = 1;
    cin>>tc;
    for(int ces=1; ces<=tc; ces++){
        solv(ces);
    }

    return 0;
}