#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

struct xyk {
	ll x = 0;
	ll y = 0;
	ll k = 0;
};

ll dist(xyk& ca, xyk& cb) {
	return abs(ca.x - cb.x) + abs(ca.y - cb.y);
}

vector<xyk> v;
ll n, a, b;

bool sp(ll ca, ll cb) {
	return b <= abs(v[ca].k - v[cb].k);
}

bool mv2(ll ca, ll cb) {
	return a <= dist(v[ca], v[cb]);
}
bool mv3(ll ca, ll cb, ll cc) {
	return a <= dist(v[ca], v[cb]) + dist(v[ca], v[cc]);
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);


	cin >> n >> a >> b;

	v.assign(n, {});
	REP(i, n) {
		cin >> v[i].x >> v[i].y >> v[i].k;
	}

	vector<vvl> dp(1LL << n, vvl(n, vl(n, 0)));
	dp[0][0][0] = 1;

	ll ans = 0;
	REP(i, 1LL << n) {
		const ll cnt = bitset<64>(i).count();

		REP(j, n) {
			if (!((i >> j) & 1LL)) continue;
			ll b = i ^ (1LL << j);

			if (cnt == 1) {
				dp[i][j][0] = 1;
				chmax(ans, cnt);
			}
			if (cnt == 2) {
				REP(k, n) {
					if (dp[b][k][0] == 1 && (sp(j, k) || mv2(j, k))) {
						dp[i][j][k] = 1;
						chmax(ans, cnt);
					}
				}
			}
			if (cnt >= 3) {
				REP(k, n) {
					REP(l, n) {
						if (dp[b][k][l] == 1 && (sp(j, k) || mv3(j, k, l))) {
							dp[i][j][k] = 1;
							chmax(ans, cnt);
						}
					}
				}
			}
		}
	}
	

	cout << ans;
}