#include <fstream>
#include <algorithm>

using namespace std;

#define NMAX 50000

int vx[NMAX + 1], vy[NMAX + 1];

int main() {

  ifstream fin ( "tribute.in" );
  ofstream fout ( "tribute.out" );

  int n, dx, dy, i, j, ans;
  fin >> n >> dx >> dy;
  for ( i = 0; i < n; i++ ) {
    fin >> vx[i] >> vy[i];
  }
  sort (vx, vx + n); sort (vy, vy + n);
  ans = 0;
  for ( i = 0; i < n; i++ ) {
    if ( vx[i] - vx[n - i - 1] > dx) {
      ans += vx[i] - vx[n - i - 1] - dx;
    }
    if ( vy[i] - vy[n - i - 1] > dy) {
      ans += vy[i] - vy[n - i - 1] - dy;
    }
  }
  fout << ans;
  return 0;
}