#include <iostream>
#include <vector>
using namespace std;

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.at(i) >> Y.at(i) >> K.at(i);
    }

    vector dp(N, vector(N, vector<bool>(1 << N)));
    for (int i = 0; i < N; ++i) dp.at(i).at(i).at(1 << i) = true;

    int ret = 1;

    for (int S = 0; S < 1 << N; ++S) {
        for (int pre = 0; pre < N; ++pre) {
            for (int prepre = 0; prepre < N; ++prepre) {
                if (!dp.at(prepre).at(pre).at(S)) continue;
                for (int nxt = 0; nxt < N; ++nxt) {
                    if (S & (1 << nxt)) continue;
                    bool good = false;
                    if (abs(K.at(nxt) - K.at(pre)) >= B) good = true;
                    int dist = abs(X.at(nxt) - X.at(pre)) + abs(Y.at(nxt) - Y.at(pre));
                    if (pre != prepre) {
                        dist += abs(X.at(nxt) - X.at(prepre)) + abs(Y.at(nxt) - Y.at(prepre));
                    }
                    if (dist >= A) good = true;
                    if (good) {
                        dp.at(pre).at(nxt).at(S | (1 << nxt)) = 1;
                        ret = max(ret, __builtin_popcount(S | (1 << nxt)));
                    }
                }
            }
        }
    }
    cout << ret << '\n';
}