#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool dp[1 << 14][14][14];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, a, b;
  cin >> n >> a >> b;
  VI x(n), y(n), k(n);
  rep(i, n) cin >> x[i] >> y[i] >> k[i];
  VVI cdist(n, VI(n));
  rep(i, n) rep(j, n) cdist[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]);
  VVI kdist(n, VI(n));
  rep(i, n) rep(j, n) kdist[i][j] = abs(k[i] - k[j]);
  rep(i, n) dp[1 << i][0][i] = true;
  int ans = 0;
  rep(s, 1 << n) {
    int vcnt = __builtin_popcount(s);
    rep(i, n) rep(j, n) if (dp[s][i][j]) {
      chmax(ans, vcnt);
      rep(k, n) if (!(s >> k & 1)) {
        bool ok = [&] {
          if (vcnt == 1) {
            if (a <= cdist[j][k]) return true;
          } else {
            if (a <= cdist[i][k] + cdist[j][k]) return true;
          }
          if (b <= kdist[j][k]) return true;
          return false;
        }();
        if (ok) dp[s | 1 << k][j][k] = true;
      }
    }
  }
  cout << ans << '\n';
}