#include <bits/stdc++.h>
using namespace std;
int N, A, B;
const int maxn = 14;
int X[maxn], Y[maxn], K[maxn];
int dp[1 << maxn][maxn][maxn + 1];
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> N >> A >> B;
    for (int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> K[i];
    for (int i = 0; i < N; i++) {
        for (int k = 0; k <= N; k++) {
            for (int j = 0; j < 1 << N; j++) {
                dp[j][i][k] = 1e9;
            }
        }
    }
    for (int i = 0; i < N; i++) dp[1 << i][i][N] = 0;
    for (int i = 0; i < 1 << N; i++) {
        for (int j = 0; j < N; j++) {
            if (~i >> j & 1) continue;
            for (int l = 0; l <= N; l++)
                if (dp[i][j][l] != 1e9) {
                    for (int k = 0; k < N; k++) {
                        if (i >> k & 1) continue;
                        int d = abs(X[j] - X[k]) + abs(Y[j] - Y[k]);
                        int popcnt = __builtin_popcount(i);
                        auto& nxt = dp[i | 1 << k][k][j];
                        if (popcnt == 1) {
                            if (A <= d) {
                                nxt = min(nxt, dp[i][j][l]);
                            } else {
                                nxt = min(nxt, dp[i][j][l] + 1);
                            }
                        }
                        if (popcnt >= 1) {
                            int d = abs(K[j] - K[k]);
                            if (B <= d) {
                                nxt = min(nxt, dp[i][j][l]);
                            } else {
                                nxt = min(nxt, dp[i][j][l] + 1);
                            }
                        }
                        if (popcnt >= 2) {
                            int d = abs(X[j] - X[k]) + abs(Y[j] - Y[k]) + abs(X[k] - X[l]) + abs(Y[k] - Y[l]);
                            if (A <= d) {
                                nxt = min(nxt, dp[i][j][l]);
                            } else {
                                nxt = min(nxt, dp[i][j][l] + 1);
                            }
                        }
                    }
                }
        }
    }
    int ans = 0;
    for (int b = 0; b < 1 << N; b++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j <= N; j++) {
                if (dp[b][i][j] == 0) {
                    ans = max(ans, __builtin_popcount(b));
                }
            }
        }
    }
    cout << ans << "\n";
}