#include <bits/stdc++.h>
using namespace std;
/* 
ifstream fi("ograzi.in");
ofstream fo("ograzi.out");
#define cin fi
#define cout fo*/

const int NMAX = 1e6 + 10;

int n, m, w, h;
vector < pair<int, int> > dr, oi;
int aib[NMAX];
int maxx, maxy;

inline int lsb(int x)
{
    return (x & (-x));
}

void update(int poz, int val)
{
    for (int i = poz; i <= maxx + w; i += lsb(i))
        aib[i] += val;
}

int getSum(int poz)
{
    int ret = 0;
    for (int i = poz; i > 0; i -= lsb(i))
        ret += aib[i];
    return ret;
}

int query(int st, int dr)
{
    if (st == 0)
        return getSum(dr);
    return getSum(dr) - getSum(st - 1);
}

int main()
{
    FILE *fi, *fo;
    fi = fopen("ograzi.in", "r");
    fo = fopen("ograzi.out", "w");

    for (int i = 1; i <= n; i++)
    {
        int x, y;
        fscanf(fi, "%d%d", &x, &y);
        x++; y++;
        dr.push_back({y, x});

        maxx = max(maxx, x);
        maxy = max(maxy, y);
    }

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fscanf(fi, "%d%d", &x, &y);
        x++; y++;
        oi.push_back({y, x});

        maxx = max(maxx, x);
        maxy = max(maxy, y);
    }

    sort(dr.begin(), dr.end());
    sort(oi.begin(), oi.end());

    int rez = 0;
    int currDr = 0, currOi = 0, currOi2 = 0;

    // liniile 0...h
    for (int i = 0; i <= h; i++)
    {
        while (currOi < oi.size() && oi[currOi].first == i)
        {
            update(oi[currOi].second, 1);
        }
    }
    while (currDr < dr.size() && dr[currDr].first == 0)
    {
        pair <int, int> da = dr[currDr];
        rez += query(da.second, da.second + w);
        currDr++;
    }

    for (int i = h + 1; i <= maxy + h + 1; i++)
    {
        // bag linia i, scot linia i-h-1
        while (currOi < oi.size() && oi[currOi].first == i)
            update(oi[currOi].second, 1), currOi++;
                
        while (currOi2 < oi.size() && oi[currOi2].first == i - h - 1)
            update(oi[currOi2].second, -1), currOi2++;

        while (currDr < dr.size() && dr[currDr].first == i - h)
        {
            pair <int, int> da = dr[currDr];
            rez += max(0, query(da.second, da.second + w));
            currDr++;
        }
    }

    /* for (int i = maxy + 1; i <= maxy + h + 1; i++)
        while (currDr < dr.size() && dr[currDr].first == i - h)
        {
            pair <int, int> da = dr[currDr];
            rez += max(0, query(da.second, da.second + w));
            currDr++;
        }*/

    fprintf(fo, "%d", rez);

    //cout << (sizeof(dr) + sizeof(oi) + sizeof(aib)) / 1000;

    return 0;
}