#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("tribute.in");
ofstream cout("tribute.out");
const int nmax=5e4;
int n, dx, dy, x[nmax+5], y[nmax+5];
int Solve_1D (int v[nmax+5], int d)
{
    sort(v, v+n);
    int st=0, dr=n-1, ans=0;
    while(st<dr)
    {
        int dist=v[dr]-v[st]-d;
        if(dist<=0)
            break;
        ans+=dist;
        st++, dr--;
    }
    return ans;
}

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

    return 0;
}