import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

def popcnt(a): return bin(a).count("1")

n,a,b=LI()
xyk=LLI(n)
dd=[[0]*n for _ in range(n)]
for i,(x,y,k) in enumerate(xyk):
    for j,(s,t,_) in enumerate(xyk[:i]):
        dd[i][j]=dd[j][i]=abs(s-x)+abs(t-y)

dp=[[[0]*n for _ in range(n)] for _ in range(1<<n)]
for i in range(n):dp[1<<i][i][i]=1

ans=0
for s in range(1,1<<n):
    p=popcnt(s)
    for i in range(n):
        if s>>i&1==0:continue
        for j in range(n):
            if s>>j&1==0:continue
            if dp[s][i][j]==0:continue
            ans=max(ans,p)
            for k in range(n):
                ns=s|1<<k
                if ns==s:continue
                val=0
                if p==1 and dd[j][k]>=a:val=1
                if val==0 and abs(xyk[j][2]-xyk[k][2])>=b:val=1
                if val==0 and p>=2 and dd[i][k]+dd[j][k]>=a:val=1
                dp[ns][j][k]|=val

print(ans)