#include <cmath>
#include <cstdio>
#include <vector>
#include<bits/stdc++.h>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int n,x,y;
    cin>>n>>x>>y;
    vector< pair<int,int> > v;
    int lat[n];
    int lon[n];
    int pt[n];
    for(int i=0;i<n;i++)
    {
        int lt,ln,h,p;
        cin>>lt>>ln>>h>>p;
        lat[i]=lt;
        lon[i]=ln;
        pt[i]=p;
        v.push_back({h,i});
    }
    sort(v.begin(),v.end());
    int dp[200001];
    int ans=0;
    memset(dp,0,sizeof(dp));
    dp[0]=max(0,pt[v[0].second]);
    for(int i=1;i<n;i++)
    {
        int temp = INT_MIN;
        for(int j=0;j<i;j++)
        {
            int lat1 = lat[v[i].second];
            int lat2 = lat[v[j].second];
            int lon1 = lon[v[i].second];
            int lon2 = lon[v[j].second];
            if(abs(lat1-lat2)<=x && abs(lon1-lon2)<=y)
            {
                temp = max(temp,dp[j]+pt[v[i].second]);
            }
        }
        dp[i]=max(dp[i],max(pt[v[i].second],temp));
    }
    for(int i=0;i<n;i++)
        ans = max(ans,dp[i]);
    cout<<ans;
    return 0;
}