#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define endl '\n'
#define IO ios::sync_with_stdio(0),cin.tie(0); 
using namespace std;
struct vec2{
    int x,y;
    bool operator==(const vec2& r){
        return x==r.x&&y==r.y;
    }
};
struct AABB{
    vec2 mn,mx;
    bool operator==(const AABB& r){
        return mn==r.mn&&mx==r.mx;
    }
    bool operator!=(const AABB& r){
        return !(*this == r);
    }
    int id;
};
bool intersect(const AABB& x, const AABB& y){
    return x.mx.x>=y.mn.x && y.mx.x>=x.mn.x&&
    x.mx.y>=y.mn.y && y.mx.y>=x.mn.y;
}
void printA(const AABB& x){
    cout<<"IN "<<x.mn.x<<' '<<x.mn.y<<", "
                <<x.mx.x<<' '<<x.mx.y<<'\n';
}
struct Dinic{
    struct Edge{
        int v,f,re;
    };
    #define SZ(x) (int)(x.size())
    vector<vector<Edge>> E;
    vector<int> level;
    int n,s,t;
    Dinic(int nn,int ss,int tt){
        n=nn;s=ss;t=tt;
        E.resize(n);
        level.resize(n);
    }
    void addEdge(int u,int v,int w){
        E[u].push_back({v,w,SZ(E[v])});
        E[v].push_back({u,0,SZ(E[u])-1});
    }
    bool bfs(){
        queue<int> q;
        q.push(s);
        level.assign(n,0);
        level[s]=1;
        while(q.size()){
            int u=q.front();q.pop();
            for(auto&it:E[u]){
                int v=it.v;
                if(it.f>0&&!level[v]){
                    level[v]=level[u]+1;
                    q.push(v);
                }
            }
        }
        return level[t];
    }
    int dfs(int u,int nf){
        if(u==t) return nf;
        int ret=0;
        for(auto&it:E[u]){
            int v=it.v;
            if(it.f>0&&level[v]==level[u]+1){
                int tem=dfs(v,min(it.f, nf));
                ret+=tem;nf-=tem;
                it.f-=tem;E[v][it.re].f+=tem;
                if(!nf)return ret;
            }
        }
        if(!ret)level[u]=0;
        return ret;
    }
    int flow(){
        int ret=0;
        while(bfs())ret+=dfs(s,0x3f3f3f3f);
        return ret;
    }
};
vector<pii>mp[2001][2001];
bool ch(AABB a,AABB b){
    //b要1/2
    int bb=(b.mx.x-b.mn.x)*(b.mx.y-b.mn.y);
    int x,y,xx,yy;
    xx=min(a.mx.x,b.mx.x);
    yy=min(a.mx.y,b.mx.y);
    x=max(a.mn.x,b.mn.x);
    y=max(a.mn.y,b.mn.y);
    //printA(a);
    //printA(b);
    //cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<endl;
    int area=(xx-x)*(yy-y);
    if(2*area>=bb)return 1;
    else return 0;
}
signed main(){
    IO
    vector<AABB> a;
    int t;
    cin>>t;
    while(t--){
        a.clear();
        for(int i=0;i<=2000;i++){
            for(int j=0;j<=2000;j++){
                mp[i][j].clear();
            }
        }
        int n,m;
        cin>>n>>m;
        vector<AABB> dis;
        for(int i=0;i<n;i++){
            int x,y,xx,yy;
            cin>>x>>y>>xx>>yy;
            dis.push_back(AABB{{x,y},{xx,yy}});
        }
        sort(dis.begin(),dis.end(),[](AABB& a,AABB& b){
            if(a.mn.x!=b.mn.x) return a.mn.x<b.mn.x;
            if(a.mn.y!=b.mn.y) return a.mn.y<b.mn.y;
            if(a.mx.x!=b.mx.x) return a.mx.x<b.mx.x;
            return a.mx.y<b.mx.y;
        });
        dis[0].id = 0;
        a.push_back(dis[0]);
        int ids = 1;
        vector<int> num(n,1);
        for(int i=1;i<dis.size();i++){
            if(dis[i]!=dis[i-1]){
                dis[i].id=ids++;
                a.push_back(dis[i]);
            }
            else{
                num[ids-1]++;
            }
        }
        int nn=a.size();
        int s=0,t=nn+m+1;
        Dinic flow(1+nn+m+1,s,t);
        for(int i=0;i<a.size();i++){
            int x,xx,y,yy;
            x=a[i].mn.x;
            y=a[i].mn.y;
            xx=a[i].mx.x;
            yy=a[i].mx.y;
            for(int j=x;j<=xx;j++){
                for(int k=y;k<=yy;k++){
                    mp[j][k].push_back({i+1,num[i]});
                }
            }
            //cout<<s<<" "<<i+1<<endl;
            flow.addEdge(s,i+1,num[i]);
            //printA(a[i]);
            //cout<<num[i]<<endl;
        }
        for(int k=nn+1;k<=nn+m;k++){
            //cout<<k<<" "<<t<<endl;
            flow.addEdge(k,t,1);
        }
        for(int i=0;i<m;i++){
            set<pii>st;
            int x,y,xx,yy;
            cin>>x>>y>>xx>>yy;
            for(int j=x;j<=xx;j++){
                for(int k=y;k<=yy;k++){
                    for(auto ii:mp[j][k]){
                        st.insert(ii);
                    }
                }
            }
            AABB now;
            now.mn.x=x;
            now.mn.y=y;
            now.mx.x=xx;
            now.mx.y=yy;
            for(auto ii:st){
                AABB nxt;
                nxt=a[ii.first-1];
                if(ch(now,nxt)){
                    //cout<<ii.first<<" "<<nn+i+1<<endl;
                    flow.addEdge(ii.first,nn+1+i,1e9);
                }
            }
        }
        
        cout<<flow.flow()<<endl;
    }


}