#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
int v[50002],v2[50002];
int n,x,y,sol;
void read()
{
    fscanf(f,"%d %d %d",&n,&x,&y);
    for(int i=1; i<=n; i++)
        fscanf(f,"%d %d",&v[i],&v2[i]);
    sort(v+1,v+n+1);
    sort(v2+1,v2+n+1);
}
int maxim(int a,int b)
{
    return a>b ? a:b;
}
void solve()
{
    for(int i=1, j=n; i<=n && j>=1; i++,j--)
    {
        sol+=maxim(v[i]-v[j]-x,0);
        sol+=maxim(v2[i]-v2[j]-y,0);
    }
}
void write()
{
    fprintf(g,"%d",sol);
}
int main()
{
    f=fopen("tribute.in","r");
    g=fopen("tribute.out","w");
    read();
    solve();
    write();
    fclose(f);
    fclose(g);
    return 0;
}