#include<bits/stdc++.h>
using namespace std;

#define RI int

using pii = pair<int, int>;
const int N = 2005;

int m, n;
vector<array<int, 3>> rect[N][N];

namespace Network_Flow
{
    const int NN=100005,MM=1e7+5,INF=1e9;
    struct edge
    {
        int to,nxt,v;
    }e[MM<<1]; int cnt=1,head[NN],cur[NN],dep[NN],s,t;
    inline void clear(void)
    {
        memset(head,0,(t+1)*sizeof(int)); cnt=1;
    }
    inline void addedge(int x,int y,int z)
    {
        e[++cnt]=(edge){y,head[x],z}; head[x]=cnt;
        e[++cnt]=(edge){x,head[y],0}; head[y]=cnt;
    }
    #define to e[i].to
    inline bool BFS(void)
    {
        memset(dep,0,(t+1)*sizeof(int)); dep[s]=1;
        queue <int> q; q.push(s);
        while (!q.empty())
        {
            int now=q.front(); q.pop();
            for (RI i=head[now];i;i=e[i].nxt)
            if (e[i].v&&!dep[to]) dep[to]=dep[now]+1,q.push(to);
        }
        return dep[t];
    }
    inline int DFS(int now,int tar,int dis)
    {
        if (now==tar) return dis; int ret=0;
        for (RI& i=cur[now];i&&dis;i=e[i].nxt)
        if (e[i].v&&dep[to]==dep[now]+1)
        {
            int dist=DFS(to,tar,min(dis,e[i].v));
            if (!dist) dep[to]=0;
            dis-=dist; ret+=dist;
            e[i].v-=dist; e[i^1].v+=dist;
            if (!dis) return ret;
        }
        if (!ret) dep[now]=0; return ret;
    }
    #undef to
    inline int Dinic(int ret=0)
    {
        while (BFS()) memcpy(cur,head,(t+1)*sizeof(int)),ret+=DFS(s,t,INF); return ret;
    }
}

using namespace Network_Flow;

void solve(){
    for (int i=0; i<N; ++i) for (int j=0; j<N; ++j) rect[i][j].clear();

    cin >> m >> n;
    for (int i=1; 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);
        rect[x1][y1].push_back({x2, y2, i});
    }

    for (int v=1; v<=n; ++v){
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        if (x1>x2) swap(x1, x2);
        if (y1>y2) swap(y1, y2);

        for (int i=max(0, x1-3); i<x2; ++i){
            for (int j=max(0, y1-3); j<y2; ++j){
                for (auto [xd2, yd2, id] : rect[i][j]){
                    int xl = max(x1, i), xr = min(x2, xd2);
                    int yl = max(y1, j), yr = min(y2, yd2);
                    if (xl>=xr || yl>=yr) continue;
                    int area1 = (xr-xl)*(yr-yl);
                    int area2 = (xd2-i)*(yd2-j);
                    if (area1*2 >= area2) addedge(id, v+m, 1);
                }
            }
        }
    }

    s=n+m+1, t=n+m+2;
    for (int i=1; i<=m; ++i) addedge(s, i, 1);
    for (int i=m+1; i<=m+n; ++i) addedge(i, t, 1);
    cout<<Dinic()<<'\n';
    clear();
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t; while (t--) solve(); 
    return 0;
}