#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("tribute.in");
ofstream fout("tribute.out");
const int MAXN = 50000;
int x[MAXN], y[MAXN];


int sum_dist(int v[], int n, int l)
{
    int sum = 0, st = 0, dr = n - 1;

    sort(v, v + n);
    while(st < dr && v[dr] - v[st] > l)
    {
        sum += v[dr] - v[st] - l;
        st++;
        dr--;
    }
    return sum;
}


int main()
{
    int n, dx, dy, i;

    fin >> n >> dx >> dy;

    for(i = 0; i < n; i++)
        fin >> x[i] >> y[i];

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

    return 0;
}