N,A,B = map(int,input().split())
XYK = [list(map(int,input().split())) for _ in range(N)]
BN = 1 << N
dp = [[[False] * (BN) for _ in range(N+1)] for _ in range(N+1)]


def dist(a,b):
    return abs(XYK[a][0] - XYK[b][0]) + abs(XYK[a][1] - XYK[b][1])

def bit_count(x):
    cnt = 0
    while x > 0:
        if x & 1:
            cnt += 1
        x >>= 1
    return cnt

q = set()
cnt = 1
for i in range(N):
    for j in range(N):
        if i == j:
            continue
        if B <= abs(XYK[i][2]- XYK[j][2]) or A < dist(i,j):
            cnt = 2
            tmp = (1<<i)|(1<<j)
            q.add((i,j,tmp))


Pass = [[[False] * N for _ in range(N)]  for _ in range(N)]
for i in range(N):
    for j in range(N):
        if i == j:
            continue
        for k in range(N):
            if i == k or j == k:
                continue
            if B <= abs(XYK[j][2]- XYK[k][2]) or A <= dist(k,i)+dist(k,j):
                Pass[i][j][k] = True
                #print(i,j,k)

q2 = set()
while q:
    while q:
        abc = next(iter(q))
        q.remove(abc)
        a,b,c = abc
        for i in range(N):
            if c & (1 << i) == 0:
                if Pass[a][b][i]:
                    q2.add((b,i,c|(1<<i)))

    if q2:
        cnt += 1
    q,q2 = q2,q

print(cnt)