#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll N,A,B;
	cin>>N>>A>>B;
	struct point{
		ll x;
		ll y;
	};
	N++;
	auto hoj=[&](ll a)->ll{return a*a;};
	auto dist=[&](point a,point b)->ll{return hoj(a.x-b.x)+hoj(a.y-b.y);};
	vector<point> p(N);
	vector<ll> K(N);
	rep(i,1,N) cin>>p[i].x>>p[i].y>>K[i];
	vector dp(1<<N,vector(N,vector<bool>(N)));
	dp[1][0][0]=1;
	int ans=0;
	rep(i,0,1<<N) rep(j,0,N) rep(k,0,N){
		if(!dp[i][j][k]) continue;
		int c=pop_count(i);
		chmax(ans,c);
		rep(l,0,N){
			if(i&(1<<l)) continue;
			bool ok=0;
			if(c==1) ok=1;
			if(c==2&&A*A<=dist(p[l],p[k])) ok=1;
			if(2<=c&&B<=abs(K[k]-K[l])) ok=1;
			if(3<=c){
				ll x=dist(p[l],p[k]),y=dist(p[l],p[j]);
				ll tmp=A*A-x-y;
				if(tmp<=0) ok=1;
				if(tmp*tmp<=4ll*x*y) ok=1;
			}
			if(ok) dp[i+(1<<l)][k][l]=1;
		}
	}
	cout<<ans-1<<"\n";
}