N, A, B = map(int, input().split())
X, Y, K = map(list, zip(*[list(map(int, input().split())) for _ in range(N)]))

def distance(a, b):
    return abs(X[a]-X[b])+abs(Y[a]-Y[b])

dp = [[[False]*(1<<N) for _ in range(N)] for _ in range(N)]
dp[0][0][0] = True
ans = 0
for bit in range(1<<N):
    for i in range(N):
        for j in range(N):
            if not dp[i][j][bit]:
                continue
            ans = max(ans, bit.bit_count())
            if bit.bit_count() == 0:
                for k in range(N):
                    dp[k][j][bit|1<<k] = True
            elif bit.bit_count() == 1:
                for k in range(N):
                    if not 1<<k & bit and (A <= distance(k, i) or B <= abs(K[k]-K[i])):
                        dp[k][i][bit|1<<k] = True
            else:
                for k in range(N):
                    if not 1<<k & bit and (B <= abs(K[k]-K[i]) or A <= distance(k, i)+distance(k, j)):
                        dp[k][i][bit|1<<k] = True

print(ans)