#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = 20 * (1e5);
class Maxflow
{
private:
    int nedge = 1, p[2 * M], nex[2 * M], head[N], c[2 * M], cur[2 * M];
    int dist[2 * N];
    int S, T;
    void Addedge(int a, int b, int v)
    {
        p[++nedge] = b;
        nex[nedge] = head[a];
        head[a] = nedge;
        c[nedge] = v;
    }
    bool bfs()
    {
        queue<int> q;
        for (int i = S; i <= T; i++)
            dist[i] = -1;
        dist[S] = 0;
        q.push(S);
        while (!q.empty())
        {
            int now = q.front();
            q.pop();
            for (int k = head[now]; k; k = nex[k])
                if (dist[p[k]] == -1 && c[k] > 0)
                {
                    dist[p[k]] = dist[now] + 1;
                    q.push(p[k]);
                }
        }
        return dist[T] > -1;
    }
    int dfs(int x, int low)
    {
        if (x == T)
            return low;
        if (low == 0)
            return 0;
        int used = 0;
        for (int &k = cur[x]; k; k = nex[k])
            if (dist[p[k]] == dist[x] + 1 && c[k] > 0)
            {
                int a = dfs(p[k], min(c[k], low - used));
                c[k] -= a;
                c[k ^ 1] += a;
                used += a;
                if (low == used)
                    break;
            }
        if (used == 0)
            dist[x] = -1;
        return used;
    }

public:
    void givest(int s, int t)
    {
        S = s;
        T = t;
    }
    void init()
    {
        memset(head, 0, sizeof(head));
        nedge = 1;
    }
    void addedge(int a, int b, int v)
    {
        //cout << a << " " << b << " "<< v <<endl;
        Addedge(a, b, v);
        Addedge(b, a, 0);
    }
    int dinic()
    {
        int flow = 0;
        while (bfs())
        {
            for (int i = S; i <= T; i++)
                cur[i] = head[i];
            flow += dfs(S, 1e9);
        }
        return flow;
    }
};
Maxflow e;
vector<int> g[2001][2001];
struct node
{
    int x1, y1, x2, y2;
} a[50010], b[50010];
int f[2001][2001], cnt;
bool check(node x, node y) // y 要占 x 的一半
{
    cnt++;
    int sum = 0, ss = 0;
    for (int i = x.x1; i < x.x2; i++)
    {
        for (int j = x.y1; j < x.y2; j++)
        {
            f[i][j] = cnt;
            sum++;
        }
    }
    for (int i = y.x1; i < y.x2; i++)
    {
        for (int j = y.y1; j < y.y2; j++)
        {
            if (f[i][j] == cnt)
                ss++;
        }
    }
    if (ss * 2 >= sum)
        return 1;
    return 0;
}
void work()
{
    e.init();
    int m, n;
    int s = 0, t;
    scanf("%d%d", &m, &n); // m:true n:detect
    t = m + n + 1;
    e.givest(s,t);
    for (int i =1;i<=m;i++)
    {
        e.addedge(s,i,1);
    }
    for (int i =1;i<=n;i++)
    {
        e.addedge(i+m,t,1);
    }

    for (int i = 0; i <= 2000; i++)
        for (int j = 0; j <= 2000; j++)
            g[i][j].clear();
    for (int i = 1, x1, y1, x2, y2; i <= m; i++)
    {
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        a[i] = node{x1, y1, x2, y2};
        for (int x = x1; x < x2; x++)
            for (int y = y1; y < y2; y++)
            {
                g[x][y].push_back(i);
            }
    }
    for (int i = 1, x1, y1, x2, y2; i <= n; i++)
    {
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        b[i] = node{x1, y1, x2, y2};
        vector<int> q;
        for (int x = x1; x < x2; x++)
            for (int y = y1; y < y2; y++)
                for (auto z : g[x][y])
                {
                    q.push_back(z);
                }
        sort(q.begin(), q.end());
        for (int j = 0; j < (int)q.size(); j++)
        {
            if (j == 0 || q[j] != q[j - 1])
            {
                if (check(a[q[j]], b[i]))
                {
                    e.addedge(q[j], i + m, 1);
                }
            }
        }
        
    }
    cout << e.dinic() << endl;
}
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        work();
    }
}