#include "bits/stdc++.h"

#define watch(x) cout << (#x) << " is " << (x) << endl

using namespace std;
using lint = int64_t;

const int mx = 2e3 + 1;

vector<vector<set<int>>> grid;

struct bipartite_matching {
    int N, M, T;
    vector<vector<int>> adj;
    vector<int> match, seen;
    bipartite_matching(int a, int b) : N(a), M(a + b), adj(M), 
            match(M, -1), seen(M, -1), T(0) {}
    void add_edge(int a, int b) {
        assert(0 <= a && a < N && b + N < M && N <= b + N);
        adj[a].push_back(b + N);
    }
    void shuffle_edges() { // useful to break some hairy tests
        mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
        for (auto& cur : adj)
            shuffle(cur.begin(), cur.end(), rng);
    } 
    bool dfs(int cur) {
        if (seen[cur] == T) return false;
        seen[cur] = T;
        for (int nxt : adj[cur]) 
            if (match[nxt] == -1) {
                match[nxt] = cur, match[cur] = nxt;
                return true;
            }
        for (int nxt : adj[cur]) 
            if (dfs(match[nxt])) {
                match[nxt] = cur, match[cur] = nxt;
                return true;
            }
        return false;
    }
    int solve() {
        int res = 0;
        while (true) {
            int cur = 0; ++T;
            for (int i = 0; i < N; ++i) 
                if (match[i] == -1) cur += dfs(i);
            if (cur == 0) break;
            else res += cur;
        }
        return res;
    }
};

int main() {
  cin.tie(nullptr)->sync_with_stdio(false); 

  int t, n, m;
  cin >> t;
  while(t--) {
    grid.clear();
    grid.assign(mx, vector<set<int>>(mx));
    map<int,int> area;
    cin >> n >> m;
    bipartite_matching bp(m+1, n+1);
    int x1, x2, y1, y2, seq = 0;
    for(int i = 0; i < n; i++) {
      cin >> x1 >> y1 >> x2 >> y2;
      int id = ++seq;
      int curArea = 0;
      for(int i = x1; i <= x2; i++) {
        for(int j = y1; j <= y2; j++) {
          grid[i][j].insert(id);
          curArea++;
        }
      }
      area[id] = curArea;
    }
    for(int k = 0; k < m; k++) {
      cin >> x1 >> y1 >> x2 >> y2;
      unordered_map<int,int> interArea;
      for(int i = x1; i <= x2; i++) {
        for(int j = y1; j <= y2; j++) {
          for(auto &id : grid[i][j]) {
            interArea[id]++;
          }
        }
      }
      for(auto &id : interArea) {
        int key = id.first, curArea = id.second;
        if(curArea*2 >= area[key]) {
          // cout << "Green: " << k << " Red: " << key << endl;
          bp.add_edge(k, key);
        }
      }
    }
    cout << bp.solve() << endl;
  }
  return 0;
}