#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    int N, A, B, M, K, d;
    cin >> N >> A >> B;
    M = 1<<(N+1);
    vector<int> X(N+1), Y(N+1), Z(N+1);
    for (int i=1; i<=N; i++) cin >> X[i] >> Y[i] >> Z[i];
    vector<vector<vector<int>>> dp(M, vector(N+1, vector<int>(N+1)));

    for (int i=1; i<=N; i++) dp[1<<i][i][0] = 1;

    for (int i=1; i<M; i++){
        K = __builtin_popcount(i);
        if (K == 1){
            for (int j=1; j<=N; j++){
                if (1<<j & i) continue;
                for (int k=1; k<=N; k++){
                    if (j == k) continue;
                    if (dp[i][k][0] && (B<=abs(Z[j]-Z[k]) || A<=abs(X[j]-X[k])+abs(Y[j]-Y[k]))) dp[i|1<<j][j][k] = 1;
                }
            }
        }
        else{
            for (int j=1; j<=N; j++){
                if (1<<j & i) continue;
                for (int k=1; k<=N; k++){
                    bool f=0;
                    if (j == k) continue;
                    if (B<=abs(Z[j]-Z[k])) f=1;
                    for (int l=1; l<=N; l++){
                        if (dp[i][k][l] && (f || A<=abs(X[j]-X[k])+abs(Y[j]-Y[k])+abs(X[j]-X[l])+abs(Y[j]-Y[l]))) dp[i|1<<j][j][k] = 1;
                    }
                }
            }
        }
    }


    int ans=0;
    for (int i=0; i<M; i++){
        for (int j=0; j<=N; j++){
            for (int k=0; k<=N; k++) if (dp[i][j][k]) ans = max(ans, __builtin_popcount(i));
        }
    }

    cout << ans << endl;

    return 0;
}