#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("tribute.in");
ofstream out("tribute.out");
const int maxn = 50005;
int lin[maxn];
int col[maxn];
int main()
{
    int n, dx, dy;
    in >> n >> dx >> dy;
    for(int i = 1; i <= n; i++)
        in >> lin[i] >> col[i];
    sort(lin + 1, lin + n + 1);
    sort(col + 1, col + n + 1);
    int nr = 0;
    for(int i = 1; i <= n; i++)
    {
        int op = n - i + 1;
        if(lin[op] - lin[i] - dx > 0)
            nr = nr + lin[op] - lin[i] - dx;
        if(col[op] - col[i] - dy > 0)
            nr = nr + col[op] - col[i] - dy;
    }
    out << nr << "\n";
    return 0;
}