#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, h, w;
  cin >> n >> h >> w;
  VI a(n), b(n);
  rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
  ll ans = 0;
  rep(_, 2) {
    swap(h, w);
    swap(a, b);
    ll now = 0;
    int inc = 0;
    auto f = [&](int x, int y) {
      int d = abs(x - y) % h;
      return min(d, h - d);
    };
    vector<P> evs;
    for (int x : a) {
      now += f(x, 0);
      inc += f(x, 0) - f(x, -1);
      evs.emplace_back(x, 2);
      evs.emplace_back((x + h / 2) % h, -1);
      evs.emplace_back((x + (h + 1) / 2) % h, -1);
    }
    ll res = now;
    sort(all(evs));
    int x = 0;
    for (auto [nx, c] : evs) {
      now += ll(nx - x) * inc;
      chmax(res, now);
      inc += c;
      x = nx;
    }
    ans += res;
  }
  cout << ans << '\n';
}