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

using namespace std;

const int N = 5e4;
int x[N];
int y[N];

int dist(int v[], int l, int n){
    int st = 0;
    int dr = n-1;
    int rez = 0;
    while(v[dr] - v[st] > l){
        rez += v[dr] - v[st] - l;
        dr--;
        st++;
    }
    return rez;
}

int main() {
    int n, dx,dy;
    ifstream in("tribute.in");
    ofstream out("tribute.out");
    in>>n>>dx>>dy;
    for(int i=0;i<n;i++){
        in>>x[i]>>y[i];
    }
    sort(x,x+n);
    sort(y,y+n);
    out<<dist(x,dx,n)+dist(y,dy,n);
    return 0;
}