#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll ans;
struct Point{
	ll x,y;
	int xx;
	ll l;
	Point(){}
	Point(const ll &x,const ll &y){
		this->x=x;
		this->y=y;
	}
	void read(){
		scanf("%lld%lld",&x,&y);
	}
	ll leng2(){
		return x*x+y*y;
	}
}a[2005],p[4005];
typedef Point Vector;
Vector operator - (const Point &a,const Point &b){
	return Vector(a.x-b.x,a.y-b.y);
}
bool cmp(const Point &a,const Point &b){
	if(a.xx!=b.xx){
		return a.xx<b.xx;
	}
	if(a.x*b.y != a.y*b.x){
		return a.x*b.y > a.y*b.x;
	}
	return a.l<b.l;
}
ll dot(const Vector &a,const Vector &b){
	return a.x*b.x+a.y*b.y;
}
ll Abs(const ll &x){
	return x<0 ? (-x) : x;
}
ll area(const Vector &a,const Vector &b){
	return Abs(a.x*b.y-a.y*b.x);
}
ll Cross(const Vector &a,const Vector &b){
	return a.x*b.y-a.y*b.x;
}
ll A,B;
int n,e;
int main(){
//	freopen("j.in","r",stdin);
//	freopen("j.out","w",stdout);
	scanf("%d%lld%lld",&n,&A,&B);
	for(int i=1;i<=n;++i){
		a[i].read();
	}
	for(int i=1;i<=n;++i){
		e=0;
		for(int j=1;j<=n;++j){
			if(j!=i){
				p[++e]=a[j]-a[i];
				if(p[e].x>0 && p[e].y>=0){
					p[e].xx=1;
				}
				else if(p[e].x<=0 && p[e].y>0){
					p[e].xx=2;
				}
				else if(p[e].x<0 && p[e].y<=0){
					p[e].xx=3;
				}
				else{
					p[e].xx=4;
				}
				p[e].l=p[e].leng2();
			}
		}
		sort(p+1,p+e+1,cmp);
		for(int j=e+1;j<=2*e;++j){
			p[j]=p[j-e];
		}
		e<<=1;
		int LL=1;
		for(int j=1;j<=e/2;++j){
			while(dot(p[LL],p[j])>0 && Cross(p[LL],p[j])<=0 && LL<j+e/2){
				++LL;
			}
			if(dot(p[LL],p[j])!=0 || Cross(p[LL],p[j])>0){
				continue;
			}
			int RR=LL;
			while(Cross(p[RR],p[LL])==0 && dot(p[RR],p[LL])>0){
				++RR;
			}
			if(RR>LL){
				if(area(p[LL],p[j])<=2ll*A-1ll){
					int l=LL,r=RR-1;
					while(l<r){
						int mid=(l+r+1>>1);
						if(area(p[mid],p[j])<=2ll*A-1ll){
							l=mid;
						}
						else{
							r=mid-1;
						}
					}
					ans-=(ll)(l-LL+1);
				}
				if(area(p[LL],p[j])<=2ll*B){
					int l=LL,r=RR-1;
					while(l<r){
						int mid=(l+r+1>>1);
						if(area(p[mid],p[j])<=2ll*B){
							l=mid;
						}
						else{
							r=mid-1;
						}
					}
					ans+=(ll)(l-LL+1);
				}
			}
		}
	}
	printf("%lld\n",ans);
	return 0;
}