using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define pb push_back
#define size(V) ((int)(V.size()))
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define REP(i, N) for (int i = 0; i < (int)(N); ++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair
#define oo 1<<30

#define IN  "tribute.in"
#define OUT "tribute.out"
#define N_MAX 1<<16

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}
typedef vector<string> VS;

int N,Dx,Dy,X[N_MAX],Y[N_MAX];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	scanf("%d%d%d",&N,&Dx,&Dy);
	FOR(i,1,N)
		scanf("%d%d",X+i,Y+i);
}

II int compute(int V[],int D)
{
	int dist(0),rez(oo),i(1),j(N),a = V[1],b = a + D;
	
	for(;V[j] > b;dist += V[j] - b,--j);++j;
	
	FOR(k,2,N)
	{
		for(;j <= N && V[j] <= V[k] + D;dist -= V[j] - b,++j);
		
		dist -= (V[k] + D - b) * (N - j + 1);
		dist += (V[k] - a) * (i-1);
		
		a = V[k];
		b = a + D;
		
		for(;i <= N && V[i] < a;dist += a - V[i],++i);
		
		if(rez > dist) rez = dist;
	}
	
	i = 1,j = N,dist = 0,a = V[1] - D,b = V[1];
	
	for(;V[j] > b;dist += V[j] - b,--j);++j;
	
	FOR(k,2,N)
	{
		for(;j <= N && V[j] <= V[k];dist -= V[j] - b,++j);
		
		dist -= (V[k] - b) * (N - j + 1);
		dist += (V[k] - D - a) * (i-1);
		
		a = V[k] - D;
		b = V[k];
		
		for(;i <= N && V[i] < a;dist += a - V[i],++i);
		
		if(rez > dist) rez = dist;
	}
	
	return rez;	
}	

II void solve()
{
	sort(X+1,X+N+1);
	sort(Y+1,Y+N+1);
	
	printf("%d\n",compute(X,Dx) + compute(Y,Dy) );
}

int main()
{
	scan();
	solve();
	return 0;
}