#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
using namespace std;
using ll = long long;

int dp[1<<14][15][15];
int main(){
    int n,a,b;
    cin>>n>>a>>b;
    vector<int> x(n),y(n),k(n);
    for(int i = 0;i<n;i++) cin>>x[i]>>y[i]>>k[i];
    for(int i = 0;i<1<<n;i++) for(int j = 0;j<n;j++) for(int l = 0;l<n;l++) dp[i][j][l] = 0;
    dp[0][0][0] = 1;
    for(int i = 1;i<1<<n;i++){
        if(__builtin_popcount(i)==1){
            for(int j = 0;j<n;j++) dp[i][j][i] = 1;
        }
        for(int j = 0;j<n;j++){
            for(int l = 0;l<n;l++){
                if(j==l) continue;
                if(dp[i][j][l]==0) continue;
                for(int m = 0;m<n;m++){
                    if(i>>m&1) continue;
                    int nxt = i | 1<<m;
                    int cnt = __builtin_popcount(nxt);
                    assert(cnt>=2);
                    bool ok = false;
                    if(abs(k[l]-k[m])>=b) dp[nxt][l][m] = 1;
                    if(cnt==2){
                        if(a<=abs(x[l]-x[m])+abs(y[l]-y[m])) dp[nxt][l][m] = 1;
                    }
                    if(cnt>=3){
                        if(a<=abs(x[l]-x[m])+abs(y[l]-y[m])+abs(x[j]-x[m])+abs(y[j]-y[m]))
                            dp[nxt][l][m] = 1;
                    }
                }
            }
        }
    
    }
    int ans = 0;
    for(int i = 0;i<1<<n;i++) for(int j = 0;j<n;j++) for(int l = 0;l<n;l++) if(dp[i][j][l]) ans = max(ans,__builtin_popcount(i));
    cout<<ans<<endl;
        

}