#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, A, B;
    cin >> n >> A >> B;
    vector<tuple<int,int,int>> a(n);
    for(int i = 0; i < n; i++){
        int x, y, k;
        cin >> x >> y >> k;
        a[i] = make_tuple(x, y, k);
    }

    vector<vector<vector<bool>>> dp(1 << n, vector<vector<bool>>(n, vector<bool>(n)));
    for(int i = 0; i < n; i++) dp[1 << i][i][0] = true;
    
    auto f = [&](int i, int j, int k){
        int x1, y1, k1;
        int x2, y2, k2;
        int x3, y3, k3;
        tie(x1, y1, k1) = a[i];
        tie(x2, y2, k2) = a[j];
        tie(x3, y3, k3) = a[k];
        if(abs(k1 - k2) >= B) return true;
        if(abs(x1 - x2) + abs(y1 - y2) + abs(y2 - y3) + abs(x2 - x3) >= A) return true;
        return false;
    };

    int ans = 1;
    for(int i = 0; i < (1 << n); i++){
        int b = __builtin_popcount(i);
        if(b == 1){
            for(int j = 0; j < n; j++){
                if(!dp[i][j][0]) continue;
                int x1, y1, k1;
                tie(x1, y1, k1) = a[j];
                for(int k = 0; k < n; k++){
                    int x2, y2, k2;
                    tie(x2, y2, k2) = a[k];
                    if(i == j) continue;
                    if(A <= abs(x1 - x2) + abs(y1 - y2) || B <= abs(k1 - k2)) dp[i | (1 << k)][k][j] = true;
                }
            }
        }else{
            for(int j = 0; j < n; j++){
                if(~i >> j & 1) continue;
                for(int k = 0; k < n; k++){
                    if(!dp[i][j][k]) continue;
                    ans = max(ans, b);
                    for(int l = 0; l < n; l++){
                        if(f(l, k, j)) dp[i | (1 << l)][l][k] = true;
                    }
                }
            }
        }
    }
    cout << ans << '\n';
}