#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <limits.h>
#include <map>
using namespace std;



#define lli long long int

int maaswfedrshin() {
    int n;
    cin>>n;
    map<string,vector<pair<int,lli>>> ma;
    ma.clear();
    for(int i=0;i<n;i++){
        string str;
        int data;
        cin>>str>>data;
        if(ma.find(str)!=ma.end()){
            vector<pair<int,lli>> temp=ma[str];
            auto p=make_pair(i+1,data);
            temp.push_back(p);
            ma[str]=temp;
        }
        else{
            vector<pair<int,lli>> temp;
            auto p=make_pair(i+1,data);
            temp.push_back(p);
            ma[str]=temp;
        }
    }
    int test;
    while(test--){
        
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}

int main(){
    int n;
    int x;
    int y;
    cin >> n >> x >> y;
    int city[n][4];
    int count=0,max=0,i=0,f=0;    
    int latitude;
        int longitude;
        int height;
        int points;
    for(int a0 = 0; a0 < n; a0++){
        
        cin >> latitude >> longitude >> height >> points;
        city[a0][0]=latitude;
        city[a0][1]=longitude;
        city[a0][2]=height;
        city[a0][3]=points;
    }
 
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(city[i][2]>city[j][2]){
                latitude=city[j][0];
                city[j][0]=city[i][0];
                city[i][0]=latitude;
                
                latitude=city[j][1];
                city[j][1]=city[i][1];
                city[i][1]=latitude;
                
                 latitude=city[j][2];
                city[j][2]=city[i][2];
                city[i][2]=latitude;
                
                 latitude=city[j][3];
                city[j][3]=city[i][3];
                city[i][3]=latitude;
            }
        }
    }
    for( i=0;i<n-1;){
        if((abs(city[i][0]-city[i+1][0])<=x)&&((abs(city[i][1]-city[i+1][1])<=y))&&city[i][2]<city[i+1][2]){
            f=0;
            count=count+city[i][3];
            if(max<=count)
                max=count;
            i++;
        }else{
            f=1;
            i++;count=0;
        }
    }
    if(f==0){
         count=count+city[i][3];
            if(max<=count)
                max=count;
            i++;
    }
    cout<<max;
    return 0;
}