n,a,b = map(int,input().split())
xyk = [tuple(map(int,input().split())) for _ in range(n)]
def dist(i,j): return abs(xyk[i][0]-xyk[j][0])+abs(xyk[i][1]-xyk[j][1])
def fast(i,j): return abs(xyk[i][2]-xyk[j][2])
dp = [[[0]*n for _ in range(n)] for _ in range(1<<n)]; ans = 1
for i in range(n): dp[1<<i][i][i] = 1
for s in range(1<<n):
    for i in range(n):
        for j in range(n):
            if not dp[s][i][j]: continue
            for k in range(n):
                if s>>k&1: continue
                if fast(k,j)>=b or dist(k,j)+(i!=j)*dist(k,i)>=a: dp[s^1<<k][j][k] = dp[s][i][j]+1
                ans = max(ans,dp[s^1<<k][j][k])
print(ans)