// 嘘解法 (TLE)
// 時間いっぱい DFS

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    double TL_sec = 1.9;
    auto cur_time = []() -> double { return (double)clock() / CLOCKS_PER_SEC; };
    double start_time = cur_time();
    auto time_limit_over = [&]() -> bool { return TL_sec < cur_time() - start_time; };

    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]; }

    vector<vector<vector<bool>>> ok(N, vector<vector<bool>>(N, vector<bool>(N)));
    // a -> b
    for (int a = 0; a < N; a++) {
        for (int b = 0; b < N; b++) {
            if (a == b) { continue; }
            int d = abs(X[b] - X[a]) + abs(Y[b] - Y[a]);
            int v = abs(K[b] - K[a]);
            if (d >= A || v >= B) { ok[a][a][b] = true; }
        }
    }
    // a -> b -> c
    for (int a = 0; a < N; a++) {
        for (int b = 0; b < N; b++) {
            for (int c = 0; c < N; c++) {
                if (a == b || a == c || b == c) { continue; }
                int d = abs(X[c] - X[a]) + abs(Y[c] - Y[a]) + abs(X[c] - X[b]) + abs(Y[c] - Y[b]);
                int v = abs(K[c] - K[b]);
                if (d >= A || v >= B) { ok[a][b][c] = true; }
            }
        }
    }

    int ans = 1;

    [&]() -> void {
        vector<bool> vis(N);
        bool finish = false;
        for (int a = 0; a < N; a++) {
            for (int b = 0; b < N; b++) {
                if (not ok[a][a][b]) { continue; }
                fill(vis.begin(), vis.end(), false);
                vis[a] = vis[b] = true;
                auto dfs = [&](auto&& self, int i, int a, int b) -> void {
                    if (time_limit_over()) {
                        finish = true;
                        ans = N; // KowerKoint 追加
                        return;
                    }
                    ans = max(ans, i);
                    if (i == N) { return; }
                    for (int c = 0; c < N; c++) {
                        if (vis[c]) { continue; }
                        if (ok[a][b][c]) {
                            vis[c] = true;
                            self(self, i + 1, b, c);
                            vis[c] = false;
                        }
                        if (finish) { return; }
                    }
                };
                dfs(dfs, 2, a, b);
                if (finish) { return; }
            }
        }
    }();

    cout << ans << '\n';

    return 0;
}