#include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while((buffer[cursor] < '0' || buffer[cursor] > '9')&& buffer[cursor]!='-') {
                advance();
            }
            semn=1;
            if(buffer[cursor]=='-')
            {
                semn=-1;
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            n*=semn;
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 20;
        int cursor,semn;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
}f("ograzi.in");
ofstream g("ograzi.out");
int N,M,m,n,i,j,x,y,sol,nr,aib[1<<20],P[1<<20];
vector <pair <int,int> > O;
struct pt
{
    int x;
    int y;
    int Y;
}I[1<<16],E[1<<16];
bool cmp(pt a,pt b)
{
    return a.x<b.x;
}
void update(int x,int val)
{
    x=P[x];
    for(;x<=nr;x+=(x&(-x))) aib[x]+=val;
}
bool query(int x)
{
    int nr=0;
    x=P[x];
    for(;x;x&=(x-1)) nr+=aib[x];
    return nr>0;
}
int main()
{
    f>>N>>M>>n>>m;
    for(i=1;i<=N;++i)
    {
        f>>x>>y;
        ++y;
        P[y]=P[y+m+1]=1;
        I[i]={x,y,y+m+1};
        E[i]={x+n,y,y+m+1};
    }
    for(i=1;i<=M;++i)
    {
        f>>x>>y;
        ++y;
        P[y]=1;
        O.push_back(make_pair(x,y));
    }
    nr=1;
    for(i=1;i<=1000001;++i)
    {
        P[i]+=P[i-1];
        nr=max(nr,P[i]);
    }
    sort(I+1,I+N+1,cmp);
    sort(E+1,E+N+1,cmp);
    sort(O.begin(),O.end());
    int ins=1,ers=1,ver=0;
    for(i=0;i<=1000000;++i)
    {
        for(;I[ins].x==i&&ins<=N;++ins)
        {
            update(I[ins].y,1);
            update(I[ins].Y,-1);
        }
        for(;ver<O.size();++ver)
            if(O[ver].first==i) sol+=query(O[ver].second);
            else break;
        for(;E[ers].x==i&&ers<=N;++ers)
        {
            update(E[ers].y,-1);
            update(E[ers].Y,1);
        }
    }
    g<<sol;
    return 0;
}