#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "hvrays";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int NMAX = (1e5) + 5;

int T, N, M;
PII H[NMAX];
PII V[NMAX];

#define DIM 10000
char buff[DIM];
int poz = 0;

void read(int &numar) {
    numar = 0;
    while (buff[poz] < '0' || buff[poz] > '9')
        if (++poz == DIM)
            fread(buff, 1, DIM, stdin), poz = 0;
    while ('0' <= buff[poz] && buff[poz] <= '9') {
        numar = numar * 10 + buff[poz] - '0';
        if (++poz == DIM)
            fread(buff, 1, DIM, stdin), poz = 0;
    }
}

int main() {
    int i, j, sol, y;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    read(T);

    while(T--) {
        read(N);
        read(M);

        for(i = 1; i <= N; i++) {
            read(H[i].first);
            read(H[i].second);
        }

        for(i = 1; i <= M; i++) {
            read(V[i].first);
            read(V[i].second);
        }

        sort(H + 1, H + N + 1, greater<PII>());
        sort(V + 1, V + M + 1, greater<PII>());

        sol = y = 0;

        for(i = j = 1; i <= N; i++) {
            if(H[i].second <= y)
                continue;

            sol++;

            for(; j <= M && V[j].first >= H[i].first; j++)
                y = max(y, V[j].second);
        }

        printf("%d\n", sol);
    }

    return 0;
}