#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int dist_min (vector <int> X, int Dx, vector <int> xi)
{
	int Min = 500000, s, i, j;
	for (i = 0; i < X.size () - Dx; i++)
	{
		s = 0;
		for (j = 0; j < xi.size (); j++)
			if (X[xi[j]] != 0)
				if (xi[j] < i)
					s += /*X[xi[j]] **/ (i - xi[j]);
				else
					if (i + Dx < xi[j])
						s += /*X[xi[j]] **/ (xi[j] - i - Dx);
		Min = min (s, Min);
	}
	return Min;
}
	
int main () {

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

int n, dx, dy, i, x, y;
in >> n >> dx >> dy;

vector <int> X (n), Y (n), xi (n), yi (n);

for (i = 0; i < n; i++)
{
	in >> x >> y;
	if (x >= X.size())
		X.resize (x + 1);
	if (y >= Y.size())
		Y.resize (y + 1);
	xi[i] = x;
	yi[i] = y;
	X[x] ++;
	Y[y] ++;
}
out << dist_min (X, dx, xi) + dist_min (Y, dy, yi);

return 0;
}