#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;

const ll INF = 9223372036854775807ll;
const int inf = 2147483647;

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

int n, m, h, w, t;
struct Hasher {
    int operator()(const pi &x) const {
        return (1000003ll*((x.ff+h)/h) + (x.ss+w)/w)%666013;
    }
};
unordered_map<pi, pi, Hasher> mp;

bool inside(pi drp, pi x)
{
    return x.ff >= drp.ff && x.ff <= drp.ff+h && x.ss >= drp.ss && x.ss <= drp.ss+w;
}

int main()
{
    InParser fin ("ograzi.in");
    ofstream fout ("ograzi.out");
    fin >> n >> m >> h >> w;
    for (int i = 1; i <= n; ++i){
        pi now, now2;
        fin >> now.ff >> now.ss;
        now2 = now;
        now2.ff -= now2.ff%h;
        now2.ss -= now2.ss%w;
        mp[now2] = now;
    }
    int ans = 0;
    for (int i = 1; i <= m; ++i){
        pi now, now2;
        fin >> now.ff >> now.ss;
        now2 = now;
        now2.ff -= now2.ff%h;
        now2.ss -= now2.ss%w;
        if(mp.find(now2) != mp.end()){
            if(inside(mp[now2], now)){
                ++ans;
                continue;
            }
        }
        now2 = now;
        now2.ff -= now2.ff%h;
        now2.ss -= now2.ss%w;
        now2.ff -= h;
        if(mp.find(now2) != mp.end()){
            if(inside(mp[now2], now)){
                ++ans;
                continue;
            }
        }
        now2 = now;
        now2.ff -= now2.ff%h;
        now2.ss -= now2.ss%w;
        now2.ss -= w;
        if(mp.find(now2) != mp.end()){
            if(inside(mp[now2], now)){
                ++ans;
                continue;
            }
        }
        now2 = now;
        now2.ff -= now2.ff%h;
        now2.ss -= now2.ss%w;
        now2.ff -= h;
        now2.ss -= w;
        if(mp.find(now2) != mp.end()){
            if(inside(mp[now2], now)){
                ++ans;
            }
        }
    }
    fout << ans << "\n";
    return 0;
}