//----------shivam_wadhwa----------//
#include <bits/stdc++.h>
#define ll long long int
#define sc1(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define scll(x) scanf("%lld",&x)
#define pint(c) printf("%d",c)
#define pll(c) printf("%lld",c)
#define ps() printf(" ")
#define pn() printf("\n")

#define vi vector<int>
#define vii vector<pair<int,int> >
#define mp make_pair
#define pb push_back

//loops
#define ff(i,n,a) for(i=a;i<n;++i)
#define fb(i,n,a) for(i=n,i>=a;--i)

//constants
const int mxn=2e5+1;
const int MOD=1e9+7;
using namespace std;
int main()
{
	int t=1;
	//sc1(t);
	while(t--)
	{
		int n,x,y;
	    cin>>n>>x>>y;
	    vector< pair<int,int> > input;
	    int latitude[n];
	    int longitude[n];
	    int city[n];
	    for(int i=0;i<n;i++)
	    {
	        int lt,ln,ht,p;
	        cin>>lt>>ln>>ht>>p;
	        latitude[i]=lt;
	        longitude[i]=ln;
	        city[i]=p;
	        input.push_back(mp(ht,i));
	    }
	    sort(input.begin(),input.end());
	    int lis[mxn];
	    int finalans=0;
	    for(int i=0;i<mxn;++i)
	    	lis[i]=0;
	    lis[0]=max(0,city[input[0].second]);
	    for(int i=1;i<n;i++)
	    {
	        int temp = INT_MIN;
	        for(int j=0;j<i;j++)
	        {
	            int lt1 = latitude[input[i].second];
	            int lt2 = latitude[input[j].second];
	            int ln1 = longitude[input[i].second];
	            int ln2 = longitude[input[j].second];
	            if(abs(lt1-lt2)<=x && abs(ln1-ln2)<=y)
	            {
	                temp = max(temp,lis[j]+city[input[i].second]);
	            }
	        }
	        lis[i]=max(lis[i],max(city[input[i].second],temp));
	    }
	    for(int i=0;i<n;i++)
	        finalans = max(finalans,lis[i]);
	    cout<<finalans<<endl;
	}
	return 0;
}