#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("tribute.in");
ofstream fout("tribute.out");

const int DIM = 50001;
int n, dx, dy;
int x[DIM], y[DIM];

int Distanta(int v[], int n, int val)
{
    sort(v , v + n);
    int st = 0, dr = n - 1, s = 0;
    while(v[dr] - v[st] > val)
    {
        s += v[dr] - v[st] - val;
        dr--;
        st++;
    }
    return s;
}

int main()
{
    fin >> n >> dx >> dy;
    for(int i = 0; i < n; ++i)
        fin >> x[i] >> y[i];

    fout << Distanta(x, n, dx) + Distanta(y, n, dy);
}