#include<fstream>
#include<vector>
#define MOD 666013
using namespace std;
ofstream g("ograzi.out");
class InputReader {
  private:
    static const int BUFF_SIZE = 100000;
    FILE *f;
    int bp;
    char buff[BUFF_SIZE];
    inline void nxt() {
      if (++bp == BUFF_SIZE) {
        fread(buff, sizeof(char), BUFF_SIZE, f);
        bp = 0;
      }
    }
  public:
    InputReader (const char *file_name) {
      f = fopen(file_name, "r");
      bp = BUFF_SIZE - 1;
    }
    void close() {
      fclose(f);
    }
    InputReader& operator >> (int &num) {
      num = 0;
      while (isdigit(buff[bp]) == 0&&buff[bp]!='-')
        nxt();
      int semn=1;
      if(buff[bp]=='-')
      {
        semn=-1;
        nxt();
      }
      while (isdigit(buff[bp])) {
        num = num * 10 + (buff[bp] - '0')*semn;
        nxt();
      }
      return *this;
    }
} f("ograzi.in");
struct elem
{
    int x,y;
};
vector<elem>p[666015];

inline int key(int x,int y)
{
    return ((x*1013)^y)%MOD;
}

int main()
{
    int n,m,a,b,x,y,ox,oy,sol=0,j,l,ok,xx,yy,i,k;
    f>>n>>m>>a>>b;
    for(i=1;i<=n;i++)
    {
        f>>ox>>oy;
        x=ox/a+1;
        y=oy/b+1;
        p[key(x,y)].push_back({ox,oy});
    }
    for(i=1;i<=m;i++)
    {
        f>>ox>>oy;
        x=ox/a+1;
        y=oy/b+1;
        ok=0;
        k=key(x,y);
        l=p[k].size();
        for(j=0;j<l&&ok==0;j++)
        {
            xx=p[k][j].x;
            yy=p[k][j].y;
            if(ox>=xx&&ox<=xx+a&&oy>=yy&&oy<=yy+b)
                sol++,ok=1;
        }
        k=key(x,y-1);
        l=p[k].size();
        for(j=0;j<l&&ok==0;j++)
        {
            xx=p[k][j].x;
            yy=p[k][j].y;
            if(ox>=xx&&ox<=xx+a&&oy>=yy&&oy<=yy+b)
                sol++,ok=1;
        }
        k=key(x-1,y);
        l=p[k].size();
        for(j=0;j<l&&ok==0;j++)
        {
            xx=p[k][j].x;
            yy=p[k][j].y;
            if(ox>=xx&&ox<=xx+a&&oy>=yy&&oy<=yy+b)
                sol++,ok=1;
        }
        k=key(x-1,y-1);
        l=p[k].size();
        for(j=0;j<l&&ok==0;j++)
        {
            xx=p[k][j].x;
            yy=p[k][j].y;
            if(ox>=xx&&ox<=xx+a&&oy>=yy&&oy<=yy+b)
                sol++,ok=1;
        }
    }
    g<<sol;
    return 0;
}