#include<bits/stdc++.h>

#define MOD 1000000007
#define MAX 100005
#define ll long long
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define ss(x) scanf("%s",x)
#define pd(t) printf("%d\n",t)
#define plld(t) printf("%lld\n",t)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define mp(a,b) make_pair(a,b)
#define FF first
#define SS second
#define pb(x) push_back(x)
#define vi vector<int>
#define vpii vector<pii >
#define vll vector<ll>
#define clr(x) memset(x,0,sizeof(x))

#define FILEIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);

using namespace std;

ll power(ll a,ll b,ll m){
	ll x=1%m; a%=m;
	while(b){
		if((1&b)) x = x * a % m;
		a = a * a % m;
		b >>= 1;
	}
	return x;
}

int lat[MAX],lon[MAX],h[MAX],p[MAX];

int main(){
	int n,x,y;
	sd(n);sd(x);sd(y);
	for(int i=1;i<=n;i++){
		sd(lat[i]);
		sd(lon[i]);
		sd(h[i]);
		sd(p[i]);
	}
	int lim=1<<n;
	int ans=0;
	for(int i=1;i<lim;i++){
		vpii vec;
		int cur=0;
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				vec.pb(mp(h[j+1],j+1));
				cur+=p[j+1];
			}
		}
		sort(vec.begin(),vec.end());
		bool noans=0;
		for(int j=1;j<vec.size();j++){
			int ind=vec[j].SS;
			int pind=vec[j-1].SS;
			if(lat[ind]-lat[pind]>x){
				noans=1;
				break;
			}
			if(lon[ind]-lon[pind]>y){
				noans=1;
				break;
			}
		}
		if(noans) continue;
		ans=max(ans,cur);
	}
	pd(ans);
}