#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int m, n, z = 0;
        cin >> m >> n;
        vector<vector<int>> a(m, vector<int>(4)), b(n, vector<int>(4));
        set<vector<int>> s;
        for (int i = 0; i < m; i++) cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3], s.insert(a[i]);
        for (int i = 0; i < n; i++) cin >> b[i][0] >> b[i][1] >> b[i][2] >> b[i][3];
        for (int i = 0; i < n; i++) {
            bool y = 0;
            for (int g = 1; g <= 4; g++) for (int j = b[i][0] - g + 1; j <= b[i][2]; j++) {
                if (y) break;
                for (int h = 1; h <= 4; h++) for (int k = b[i][1] - h + 1; k <= b[i][3]; k++) {
                    if (y) break;
                    //cout << j << ' ' << j + g - 1 << ' ' << k << ' ' << k + h - 1 << '\n';
                    vector<int> t = {j, k, j + g, k + h};
                    int e = min(b[i][2], t[2]) - max(b[i][0], t[0]);
                    int f = min(b[i][3], t[3]) - max(b[i][1], t[1]);
                    if (e < 0 || f < 0) continue;
                    if (e * f * 2 < g * h) continue;
                    if (s.find(t) != s.end()) {
                        s.erase(s.find(t));
                        y = 1;
                        //cout << i << ' ' << e << ' ' << f << ' ' << g << ' ' << h << ' ' << t[0] << ' ' << t[1] << ' ' << t[2] << ' ' << t[3] << '\n';
                        break;
                    }
                }
            }
            if (y) z++;
        }
        cout << z << '\n';
    }
}