#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;

const string file = "tribute";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

int N, DX, DY;

vector<int> xs;
vector<int> ys;

int solve(vector<int>& v, int dx)
{
	sort(v.begin(), v.end());

	int mini = v.front();
	int maxi = v.back();


	vector<int> c(maxi - mini + 1);
	vector<int> fwd(maxi - mini + 1);
	vector<int> bck(maxi - mini + 1);

	for(int i = 0; i < (int) v.size(); i++)
	{
		c[v[i] - mini]++;
	}
	
	partial_sum(c.begin(), c.end(), fwd.begin());
	partial_sum(fwd.begin(), fwd.end(), fwd.begin());
	partial_sum(c.rbegin(), c.rend(), bck.rbegin());
	partial_sum(bck.rbegin(), bck.rend(), bck.rbegin());


	if(maxi - mini + 1 <= dx)
		return 0;

	int sol = INF;
	for(int i = mini; i + dx <= maxi; i++)
	{
		int f = i > mini ? fwd[i- mini -1] : 0;
		int r = i + dx < maxi ? bck[i - mini + dx + 1] : 0;
		sol = min(sol, f + r);
	}


	return sol;
}


int main()
{
	fstream fin(infile.c_str(), ios::in);
	fin >> N >> DX >> DY;
	xs.resize(N);
	ys.resize(N);
	for(int i = 0; i < N; i++)
	{
		fin >> xs[i];
		fin >> ys[i];
	}
	fin.close();

	

	fstream fout(outfile.c_str(), ios::out);
	fout << solve(xs, DX) + solve(ys, DY) << "\n";
	fout.close();
}