def popcount(x):
    x = x - ((x >> 1) & 0x55555555)
    x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
    x = (x + (x >> 4)) & 0x0F0F0F0F
    x += x >> 8
    x += x >> 16
    return x & 0x0000003F


n, a, b = map(int, input().split())
X = [0] * n
Y = [0] * n
K = [0] * n
for i in range(n):
    X[i], Y[i], K[i] = map(int, input().split())


def f(bit, i, j):
    return (bit * n + i) * n + j


dp = [False] * ((1 << n) * n * n)
for i in range(n):
    dp[f(1 << i, i, i)] = True


def dist(i, j):
    return abs(X[i] - X[j]) + abs(Y[i] - Y[j])


for bit in range(1 << n):
    ind = []
    for i in range(n):
        if bit >> i & 1:
            ind.append(i)

    for i in ind:
        for j in ind:
            if i == j:
                continue
            if len(ind) == 2 and a <= dist(i, j):
                dp[f(bit, i, j)] |= dp[f(bit ^ (1 << j), i, i)]
            if b <= abs(K[i] - K[j]):
                dp[f(bit, i, j)] |= dp[f(bit ^ (1 << j), i, i)]

            for k in ind:
                if k == i or k == j:
                    continue

                if a <= dist(i, k) + dist(j, k):
                    dp[f(bit, j, k)] |= dp[f(bit ^ (1 << k), i, j)]
                if b <= abs(K[j] - K[k]):
                    dp[f(bit, j, k)] |= dp[f(bit ^ (1 << k), i, j)]

ans = 0
for bit in range(1 << n):
    pc = popcount(bit)
    for i in range(n):
        for j in range(n):
            if dp[f(bit, i, j)]:
                ans = max(ans, pc)

print(ans)