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

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
} in( "hvrays.in" );
ofstream out( "hvrays.out" );

const int DIM = 1e5 + 5;

pair<int, int> hray[DIM], vray[DIM];

int main( void ) {

    int t;
    in >> t;

    while( t -- ) {
        int n, m;
        in >> n >> m;

        for( int i = 1; i <= n; i ++ )
            in >> hray[i].first >> hray[i].second;
        for( int i = 1; i <= m; i ++ )
            in >> vray[i].first >> vray[i].second;

        sort( hray + 1, hray + n + 1, greater<pair<int, int> >() );
        sort( vray + 1, vray + m + 1, greater<pair<int, int> >() );

        int mxm = -1, ans = 0;
        for( int i = 1, j = 1; i <= n; i ++ ) {
            if( mxm >= hray[i].second )
                continue;

            ans ++;
            while( j <= m && vray[j].first >= hray[i].first )
                mxm = max( mxm, vray[j ++].second );
        }

        out << ans << endl;
    }

    return 0;
}