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

using namespace std;

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

const int N = 5e4;

int n, dx, dy;
int x[N + 5], y[N + 5];

int distanta(int v[], int len) {
    sort(v + 1, v + n + 1);
    int ans = 0, st = 1, dr = n;
    while(v[dr] - v[st] > len) {
        ans += v[dr] - v[st] - len;
        st++;
        dr--;
    }
    return ans;
}

int main() {
    in >> n >> dx >> dy;
    for (int i = 1; i <= n; i++)
        in >> x[i] >> y[i];
    out << distanta(x, dx) + distanta(y, dy);
    return 0;
}