#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
int dx[]={0,-1,0,-1};
int dy[]={0,0,-1,-1};
int h,w,n,i,j,m,x,y,sol;
vector<pair<int,int> >Hash[MOD];
bool hash_find(pair<int,int> x)
{
    for(int i=0;i<4;i++)
    {
        int key=((x.first/w+dx[i])*1000+x.second/h+dy[i])%MOD;
        if(key<0)
            continue;
        for(vector<pair<int,int> >::iterator it=Hash[key].begin();it!=Hash[key].end();it++)
            if (it->first<=x.first && x.first<=it->first+w && it->second<=x.second && x.second<=it->second+h)
                return true;
    }
    return false;
}
int main()
{
    freopen("ograzi.in","r",stdin);
    freopen("ograzi.out","w",stdout);
    scanf("%d %d %d %d",&n,&m,&w,&h);
    for(i=1;i<=n;i++)
        scanf("%d %d",&x,&y),
        Hash[((x/w)*1000+y/h)%MOD].push_back(make_pair(x,y));
    for(i=1;i<=m;i++)
        scanf("%d %d",&x,&y),
        sol+=hash_find(make_pair(x,y));
    printf("%d",sol);
    return 0;
}