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



class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

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;
	}
};

InParser fi("ograzi.in");
OutParser fo("ograzi.out");

const int MOD = 1000003;

int n, m, w, h;
pair <int, int> M[MOD];

inline long long cod(int a, int b)
{
    return (1LL * a << 32) + b;
}

inline int getMod(long long x, int M)
{
    return x - x / M * M;
}

inline void atribuie(int a, int b, int x, int y)
{
    /// M[{a, b}] = {x, y}
    long long mask = cod(a, b);
    long long h = mask % MOD;
    M[h] = {x, y};
}

inline pair <int, int> val(int a, int b)
{
    long long mask = cod(a, b);
    long long h = mask % MOD;
    return M[h];
}

int main()
{
    fi >> n >> m >> w >> h;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        fi >> x >> y;
        int ii = ceil(1.00 * (x - 0.5) / w);
        int jj = ceil(1.00 * (y - 0.5) / h);
        atribuie(ii, jj, x, y);

        //cout << ii << " " << jj << "\n";
    }

    int rez = 0;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fi >> x >> y;

        int ii1 = ceil(1.00 * (x - 0.5) / w);
        int ii2 = floor(1.00 * (x - 0.5) / w);
        int jj1 = ceil(1.00 * (y - 0.5) / h);
        int jj2 = floor(1.00 * (y - 0.5) / h);

        vector < pair<int, int> > dr;

        if (val(ii1, jj1) != mp(0, 0))
            dr.push_back(val(ii1, jj1));
        if (val(ii1, jj2) != mp(0, 0))
            dr.push_back(val(ii1, jj2));
        if (val(ii2, jj1) != mp(0, 0))
            dr.push_back(val(ii2, jj1));
        if (val(ii2, jj2) != mp(0, 0))
            dr.push_back(val(ii2, jj2));

        //cout << dr[0].first << " " << dr[0].second;

        for (auto no: dr)
        {
            if (no.first <= x && x <= no.first + w && no.second <= y && y <= no.second + h)
                rez++;
        }

        //cout << rez << " ";
    }

    fo << rez;

    return 0;
}