#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(), (a).end()
#define X first
#define Y second

const ll INF = LLONG_MAX;
const int MOD = 1e9 + 7, MAXN = 2e5 + 1337;
const ld EPS = 1e-6;

void solve();

int main() {
#ifdef LOCAL
    freopen("../main_cpp/input.txt", "r", stdin);
#else
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
}

vector<int> g[MAXN];

struct Rect {
    int x1, y1, x2, y2;

    int sq() {
        if (min(x2 - x1, y2 - y1) <= 0) return 0;
        return (x2 - x1) * (y2 - y1);
    }

    int intersec(const Rect oth) const {
        Rect ans;
        ans.x1 = max(x1, oth.x1);
        ans.y1 = max(y1, oth.y1);
        ans.x2 = min(x2, oth.x2);
        ans.y2 = min(y2, oth.y2);
        return ans.sq();
    }
};

const int MX = 2000 + 10;

vector<int> have[MX][MX];

vector<int> py(MAXN, -1), px(MAXN, -1), usd(MAXN, 0), in(MAXN, false);

int timer = 1;

bool dfs(int v) {
    if (++in[v] >= 3700) return false;
    usd[v] = timer;
    for (auto &to: g[v]) {
        if (px[to] == -1 || usd[px[to]] != timer && dfs(px[to])) {
            px[to] = v;
            py[v] = to;
            return true;
        }
    }
    return false;
}

void solve() {
    timer = 1;
    for (int i = 0; i < MX; ++i) for (int j = 0; j < MX; ++j) have[i][j].clear();
    int n, m;
    cin >> n >> m;
    int sz = n + m + 10;
    for (int i = 1; i <= sz; ++i) {
        py[i] = px[i] = -1;
        usd[i] = in[i] = 0;
        g[i].clear();
    }
    vector<Rect> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].x1 >> a[i].y1 >> a[i].x2 >> a[i].y2;
        for (int x = a[i].x1; x <= a[i].x2; ++x) {
            for (int y = a[i].y1; y <= a[i].y2; ++y) {
                have[x][y].push_back(i);
            }
        }
    }
    for (int i = 1; i <= m; ++i) {
        int ind = i + n;
        Rect cur;
        cin >> cur.x1 >> cur.y1 >> cur.x2 >> cur.y2;
        for (int x = cur.x1; x <= cur.x2; ++x) {
            for (int y = cur.y1; y <= cur.y2; ++y) {
                for (auto &el : have[x][y]) {
                    if (a[el].intersec(cur) * 2 >= a[el].sq()) {
                        g[el].push_back(ind);
                        g[ind].push_back(el);
                    }
                }
            }
        }
    }
    for (int i = 1; i <= sz; ++i) {
        sort(all(g[i])), g[i].resize(unique(all(g[i])) - g[i].begin());
    }
    vector<int> t(n);
    iota(all(t), 1);
    mt19937 gg(1488);
    shuffle(all(t), gg);
    int ans = 0;
    for (int run = 1;run;) {
        run = 0;
        ++timer;
        for (auto &i : t) {
            if (py[i] == -1 && dfs(i)) {
                ++ans;
                run = 1;
            }
        }
    }
//    for (auto &i : t) ans += py[i] == -1 && dfs(i), ++timer;
    cout << ans << "\n";
}