#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int distante(vector <int> &v, int d)
{
    sort(v.begin(), v.end());
    int st = 0, dr = (int)v.size() - 1, s_dist = 0;
    while (v[dr] - v[st] > d)
    {
        s_dist += v[dr--] - v[st++] - d;
    }
    return s_dist;
}

int main()
{
    ifstream in("tribute.in");
    ofstream out("tribute.out");
    int n, dx, dy;
    in >> n >> dx >> dy;
    vector <int> x(n), y(n);
    for (int i = 0; i < n; i++)
    {
        in >> x[i] >> y[i];
    }
    out << (long long)distante(x, dx) + distante(y, dy) << "\n";
    in.close();
    out.close();
    return 0;
}