#include <algorithm>
#include <cstdio>

using namespace std;

int x[50005], y[50005];

int main()
{
    freopen("tribute.in", "r", stdin);
    freopen("tribute.out", "w", stdout);
    int n, lx, ly, st = 0, dr;
    long long s = 0;
    scanf("%d%d%d", &n, &lx, &ly), dr = n - 1;
    for(int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
    sort(x, x + n), sort(y, y + n);
    while(x[dr] - x[st] > lx)
        s += x[dr--] - x[st++] - lx;
    st = 0, dr = n - 1;
    while(y[dr] - y[st] > ly)
        s += y[dr--] - y[st++] - ly;
    printf("%d", s);
    return 0;
}