#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("hvrays.in");
ofstream g("hvrays.out");

#define x first
#define y second
#define LE 100666

pair<int,int> ox[LE],oy[LE];

int main() {
    int nrt;
    f>>nrt;

    for(int tt=1; tt<=nrt; ++tt) {

        int i,orz,vert;
        f>>orz>>vert;

        for(i=1; i<=orz;  ++i) f>>ox[i].x>>ox[i].y;
        for(i=1; i<=vert; ++i) f>>oy[i].x>>oy[i].y;

        sort(ox+1,ox+orz+1);
        sort(oy+1,oy+vert+1);

        int ymax=-1,lasty=-1,nr_drept=0,j=vert;

        for(i=orz; i>=1; --i) {

            for(; j>=1&&oy[j].x>=ox[i].x;) {
                ymax=max(ymax,oy[j].y);
                --j;
            }

            if (ox[i].y<=lasty)
                continue;

            ++nr_drept;
            lasty=ymax;
        }
        g<<nr_drept<<'\n';
    }


    f.close();
    g.close();
    return 0;
}