#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 string file = "ograzi";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647;

int n, m, h, w, t, aib[1000006];
vector<int> p[1000006];
vector<pi> d[1000006];

void update(int idx, int val)
{
    while(idx <= n){
        aib[idx] += val;
        idx += (idx & (-idx));
    }
}

int read(int idx)
{
    int sum = 0;
    while(idx){
        sum += aib[idx];
        idx -= (idx & (-idx));
    }
    return sum;
}

int main()
{
    ifstream fin (file+".in");
    ofstream fout (file+".out");
    fin >> n >> m >> w >> h;
    for (int i = 1; i <= n; ++i){
        int a, b;
        fin >> a >> b;
        a += h;
        b += w;
        d[i].push_back({a, b});
    }
    return 0;
}