#include <bits/stdc++.h>
#define ll unsigned long long int
//"\n"
using namespace std;

string nume="tribute";
ifstream fin(nume+".in");
ofstream fout(nume+".out");
int n,dx,dy;
inline int dist(vector<int> &v,int n,int val)
{
    sort(v.begin(),v.end());

    int st=0,dr=n-1,s=0;
    while(v[dr]-v[st]>val)
    {
        s+=v[dr]-v[st]-val;
        dr--;
        st++;
    }
    return s;
}
int main()
{
    fin>>n>>dx>>dy;
    vector<int>x(n),y(n);
    for(int i=0;i<n;i++)
    {
        fin>>x[i]>>y[i];
    }
    fout<<dist(x,n,dx)+dist(y,n,dy);
}
/*
A(x1,y1) B(x2,y2)
manh dist = abs(x2-x1)
        +abs(y2-y1);

P(xp,yp)-punctul cautat
O(x,y)-obiectiv

dist = abs(xp-x)+abs(yp-y);

sortezi cei 2 vectori(x,y) si cauti
unde se obtine distanta minima
*/