#!/bin/python

import sys


n,x,y = raw_input().strip().split(' ')
n,x,y = [int(n),int(x),int(y)]

path = []
for a0 in xrange(n):
    latitude,longitude,height,points = raw_input().strip().split(' ')
    latitude,longitude,height,points = [int(latitude),int(longitude),int(height),int(points)]
    path.append((latitude, longitude, height, points))
path.sort(key=lambda x: x[2])

p = [path[0][3]] + [0]*(n-1)
for i in range(1,n):
    for j in range(i):
        if abs(path[i][0]-path[j][0])<=x and abs(path[i][1]-path[j][1])<=y:
            p[i] = max(p[i], p[j] + path[i][3])
print p[n-1]