#include <bits/stdc++.h>

using namespace std;
ofstream fout("ograzi.out");
int n,m,w,h;
set<pair<int,int>> rects;
vector<pair<int,int>> points;
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;
	}
};
int main()
{
    InParser fin("ograzi.in");
    fin>>n>>m>>w>>h;
    int counter = 0;

    for(int i = 0;i<n;i++){
        pair<int,int> p;
        fin>>p.first>>p.second;
        rects.insert(p);
    }
    for(int i = 0;i<m;i++){
        pair<int,int> p;
        fin>>p.first>>p.second;
        points.push_back(p);
    }
    for(int i = 0;i<m;i++)
    {
        auto loweri = rects.lower_bound({points[i].first-w,points[i].second});
        auto higheri = rects.upper_bound({points[i].first,points[i].second+h});
        while(loweri!=higheri)
        {
            if(points[i].second>=(*loweri).second && points[i].second<= (*loweri).second+h)
                counter++;
            loweri++;
        }
    }
    fout<<counter<<'\n';
    return 0;
}