#include<cstdio>
#include<algorithm>
using namespace std;
#define N 50005
long x[N],y[N],n,dx,dy,i;

int c(long a,long b)
{return a<b;}
      
long h(long x[N],long dx)
{long k=0,j=0,m=N,z[N]={0},p[N],r[N];
sort(x+1,x+n+1,c);
for(i=1;i<=n;i++)
      z[x[i]+1]++;
z[x[1]]=p[x[1]]=r[x[1]]=0;
for(i=x[1];i<=x[n]-dx;i++)
      {j+=z[i],p[i+1]=p[i]+j;
      k+=z[x[n]-i+2];
      r[i+1]=r[i]+k;}
for(i=x[1];i<=x[n]-dx;i++)
if(m>(k=p[i+1]+r[x[n]-dx-i+1]))
      m=k;
return m;}

int main()
{FILE *f=fopen("tribute.in","r"),*g=fopen("tribute.out","w");
fscanf(f,"%ld%ld%ld",&n,&dx,&dy);
for(i=1;i<=n;i++)
      fscanf(f,"%ld%ld",&x[i],&y[i]);
fprintf(g,"%ld",h(x,dx)+h(y,dy));
return 0;}