#include<bits/stdc++.h>
using namespace std;
const int N=5e4+5,maxn=1e6;
struct mat{int x1,y1,x2,y2;}a[N],b[N];
int head[maxn],go[maxn],nxt[maxn],flow[maxn],dis[maxn],cur[maxn];
vector<int> mp[505][505];
int n=0,m,T,tot,St,Ed;
bool check(mat a,mat b){
    int x1=max(a.x1,b.x1),x2=min(a.x2,b.x2),y1=max(a.y1,b.y1),y2=min(a.y2,b.y2);
    if (x1>x2 || y1>y2) return 0;
    return 2*(x2-x1)*(y2-y1)>=(a.x2-a.x1)*(a.y2-a.y1);
}
void add(int x,int y,int z){
    // printf("%d %d %d\n",x,y,z);
    ++tot;go[tot]=y;nxt[tot]=head[x];head[x]=tot;flow[tot]=z;
    ++tot;go[tot]=x;nxt[tot]=head[y];head[y]=tot;flow[tot]=0;
}
vector<pair<int,int>> edge;
void link(int x,int y,int id){
    for (int i:mp[x][y])
        if (check(a[i],b[id]))
            edge.emplace_back(i,id+n);
}
void clear(){
    for (int i=0;i<=500;++i)
        for (int j=0;j<=500;++j)
            mp[i][j].clear();
    tot=1;St=n+m+1;Ed=n+m+2;
    for (int i=1;i<=n+m+2;++i) head[i]=0;
    edge.clear();
}
queue<int> q;
bool bfs(){
    for (int i=1;i<=n+m+2;++i) dis[i]=-1;
    dis[St]=1;q.emplace(St);
    while (!q.empty()){
        int x=q.front();q.pop();
        for (int i=head[x];i;i=nxt[i])
            if (flow[i] && dis[go[i]]==-1){
                dis[go[i]]=dis[x]+1;
                q.emplace(go[i]);
            }
    }
    return dis[Ed]!=-1;
}
int dfs(int x,int flw){
    if (x==Ed) return flw;
    int sum=0;
    for (int &i=cur[x];i;i=nxt[i])
        if (dis[go[i]]==dis[x]+1 && flow[i]){
            int t=dfs(go[i],min(flw-sum,flow[i]));
            flow[i]-=t,flow[i^1]+=t,sum+=t;
            if (sum==flw) return flw;
        }
    return sum;
}
int dinic(){
    int res=0;
    while (bfs()){
        for (int i=1;i<=n+m+2;++i) cur[i]=head[i];
        res+=dfs(St,1e8);
        // printf("%d\n",res);
    }
    return res;
}
void work(){
    scanf("%d%d",&n,&m);
    clear();
    for (int i=1;i<=n;++i){
        scanf("%d%d%d%d",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2);
        mp[a[i].x1/4][a[i].y1/4].emplace_back(i);
        mp[a[i].x1/4][a[i].y2/4].emplace_back(i);
        mp[a[i].x2/4][a[i].y1/4].emplace_back(i);
        mp[a[i].x2/4][a[i].y2/4].emplace_back(i);
    }
    for (int i=1;i<=m;++i){
        scanf("%d%d%d%d",&b[i].x1,&b[i].y1,&b[i].x2,&b[i].y2);
        link(b[i].x1/4,b[i].y1/4,i);
        link(b[i].x1/4,b[i].y2/4,i);
        link(b[i].x2/4,b[i].y1/4,i);
        link(b[i].x2/4,b[i].y2/4,i);
    }
    sort(edge.begin(),edge.end());
    edge.erase(unique(edge.begin(),edge.end()),edge.end());
    for (auto e:edge) add(e.first,e.second,1);
    for (int i=1;i<=n;++i) add(St,i,1);
    for (int i=1;i<=m;++i) add(i+n,Ed,1);
    printf("%d\n",dinic());    
}
int main(){
    // freopen("a.in","r",stdin);
    for (scanf("%d",&T);T;--T) work();
    return 0;
}