#include <algorithm>
#include <fstream>

using namespace std;

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

const int nmax= 50000;

int x[nmax+1], y[nmax+1];

int main(  ) {
    int n, a, b;
    fin>>n>>a>>b;
    for ( int i= 1; i<=n; ++i ) {
        fin>>x[i]>>y[i];
    }

    sort( x+1, x+n+1 );
    sort( y+1, y+n+1 );

    int sol= 0;
    for ( int i= 1; i<=n; ++i ) {
        if ( x[n-i+1]-x[i]-a>0 ) {
            sol= sol+x[n-i+1]-x[i]-a;
        }
        if ( y[n-i+1]-y[i]-b>0 ) {
            sol= sol+y[n-i+1]-y[i]-b;
        }
    }

    fout<<sol<<"\n";

    return 0;
}