#include <bits/stdc++.h>

using namespace std;
ifstream in("tribute.in");
ofstream out("tribute.out");
const int N = 50005;
struct p
{
    int x,y;
}v[N];
int cnt[2][N], i1, i2, n;
int solve()
{
    int left=0,right=n,dist=0,Min = N;
    for (int i = i1; i<=i2; i++)
        dist+=cnt[1][i]*abs(i-i1+1);
    for (int i = i1; i<=i2; i++)
    {
        dist-=right;
        right-=cnt[1][i];
        left+=cnt[0][i];
        dist+=left;
        Min = min(Min,dist);
    }
    return Min;
}
int main()
{
    int dx,dy;
    in >> n >> dx >> dy;
    for (int i = 1; i<=n; i++)
        in >> v[i].x >> v[i].y;
    i1 =  N;
    i2 = -N;
    for (int i = 1; i<=n; i++)
    {
        i1 = min(i1,v[i].x);
        i2 = max(i2,v[i].x+dx+1);
        cnt[1][v[i].x]++;
        cnt[0][v[i].x+dx+1]++;
    }
    int Minx = solve();
    memset(cnt[0],0,sizeof(cnt[0]));
    memset(cnt[1],0,sizeof(cnt[1]));
    i1 =  N;
    i2 = -N;
    for (int i = 1; i<=n; i++)
    {
        i1 = min(i1,v[i].y);
        i2 = max(i2,v[i].y+dy+1);
        cnt[1][v[i].y]++;
        cnt[0][v[i].y+dy+1]++;
    }
    int Miny = solve();
    out << Minx + Miny;
}