#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int K = 2020;
vector<int> ids[K][K];

const int MAXN = 50500;
vector<int> G[MAXN];
int used[MAXN];
int couple[MAXN];

bool khun(int v, int c) {
  if (used[v] == c)
    return false;
  used[v] = c;
  for (int u : G[v]) {
    if (couple[u] == -1) {
      couple[u] = v;
      return true;
    }
  }
  for (int u : G[v]) {
    if (khun(couple[u], c)) {
      couple[u] = v;
      return true;
    }
  }
  return false;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<pair<pair<int, int>, pair<int, int>>> A(n);
    for (int i = 0; i < n; ++i) {
      int x1, y1, x2, y2;
      cin >> x1 >> y1 >> x2 >> y2;
      if (x1 > x2)
        swap(x1, x2);
      if (y1 > y2)
        swap(y1, y2);
      A[i] = make_pair(make_pair(x1, y1), make_pair(x2, y2));
    }
    vector<pair<int, int>> kek;
    for (int i = 0; i < m; ++i) {
      int x1, y1, x2, y2;
      cin >> x1 >> y1 >> x2 >> y2;
      if (x1 > x2)
        swap(x1, x2);
      if (y1 > y2)
        swap(y1, y2);
      for (int x = x1; x < x2; ++x) {
        for (int y = y1; y < y2; ++y) {
          ids[x][y].emplace_back(i);
          kek.emplace_back(x, y);
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
      auto [x1, y1] = A[i].first;
      auto [x2, y2] = A[i].second;
      int area = 0;
      map<int, int> cnt;
      for (int x = x1; x < x2; ++x) {
        for (int y = y1; y < y2; ++y) {
          ++area;
          for (int i : ids[x][y])
            ++cnt[i];
        }
      }
      for (auto [j, x] : cnt) {
        if (2 * x >= area) {
          G[i].emplace_back(j);
        }
      }
    }
    fill(used, used + n, -1);
    fill(couple, couple + m, -1);
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    random_shuffle(order.begin(), order.end());
    vector<bool> has_couple(n, false);
    for (int ttime = 0; ; ++ttime) {
      bool chng = false;
      for (int v : order) {
        if (has_couple[v])
          continue;
        if (khun(v, ttime)) {
          chng = true;
          ++ans;
          has_couple[v] = true;
        }
      }
      if (!chng)
        break;
    }
    cout << ans << '\n';
    for (int i = 0; i < n; ++i)
      G[i].clear();
    for (auto [x, y] : kek)
      ids[x][y].clear();
  }
  return 0;
}