#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, a, b; cin >> n >> a >> b;
	vector<int>x(n), y(n), k(n);
	rep(i, n)cin >> x[i] >> y[i] >> k[i];
	auto dist = [&](int i, int j)->int {
		int ret = 0;
		ret += abs(x[j] - x[i]);
		ret += abs(y[j] - y[i]);
		return ret;
	};
	auto chk0 = [&](int i, int j)->bool {
		return a <= dist(i, j);
	};
	auto chk1 = [&](int i, int j)->bool {
		return b <= abs(k[i] - k[j]);
	};
	auto chk2 = [&](int s, int t, int u)->bool {
		return a <= dist(s, u) + dist(t, u);
	};
	vector dp(1 << n, vector(n, vector<bool>(n, false)));
	rep(i, n)rep(j, n) {
		if (i == j)continue;
		if (chk0(i, j))dp[(1 << i) + (1 << j)][i][j] = true;
		if (chk1(i, j))dp[(1 << i) + (1 << j)][i][j] = true;
	}
	rep(i, 1 << n)rep(j, n)rep(k, n) {
		if (!dp[i][j][k])continue;
		rep(l, n) {
			if (1 & (i >> l))continue;
			int ni = i + (1 << l);
			if (chk1(k, l))dp[ni][k][l] = true;
			if (chk2(j, k, l))dp[ni][k][l] = true;
		}
	}
	int ans = 1;
	rep(i, 1 << n)rep(j, n)rep(k, n) {
		if (!dp[i][j][k])continue;
		chmax(ans, popcount(i));
	}
	cout << ans << endl;
	return 0;
}