#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>

#include <memory.h>
#include <assert.h>

#define y0 sdkfaslhagaklsldk

#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#define j1 assdgsdgasghsf
#define tm sdfjahlfasfh
#define lr asgasgash
#define norm asdfasdgasdgsd
#define have adsgagshdshfhds
#define ends asdgahhfdsfshdshfd
#define right asdashgasrhsdf

#define eps 1e-14
#define M_PI 3.141592653589793
#define bs 1000000007
#define bsize 64

#define ldouble long double

using namespace std;

long long INF = 1e9;
const int N = 900031;

long long n,x,y,a[N],b[N],h[N],score[N];
vector<int> list_with_h[N];
long long dp[N];
long long ans[N];

set<pair<long long, long long> > S;
set<pair<long long, long long> > ::iterator it;
vector<int> v_list[N];

long long ss[N];

int main(){
	//freopen("tree.in","r",stdin);
	//freopen("tree.out","w",stdout);
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	ios_base::sync_with_stdio(0);
	//cin.tie(0);

	int flag=0;

	cin>>n>>x>>y;

	if (x>y)
	{
		flag=1;
	}
	for (int i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i]>>h[i]>>score[i];
		if (flag)
			swap(a[i],b[i]);
		a[i]+=200006;
		v_list[a[i]].push_back(i);
		list_with_h[h[i]].push_back(i);
	}

	for (int i=1;i<N;i++)
	{
		ss[i]=ss[i-1]+list_with_h[i].size();
	}

	if (flag)
		swap(x,y);

	for (int i=1;i<=n;i++)
	{
		ans[i]=-1e18;
	}

	//if (x<100)
	//	return 1;

	for (int cur_h=0;cur_h<=200000;cur_h++)
	{
		for (int i=0;i<list_with_h[cur_h].size();i++)
		{
			int id=list_with_h[cur_h][i];
			ans[id]=score[id];

			it=S.end();
			for (int iter=1;iter<=250;iter++)
			{
				if (it==S.begin())
					break;
				--it;
				int j=(*it).second;
				if (h[j]<cur_h&&abs(a[id]-a[j])<=x&&abs(b[id]-b[j])<=y)
					ans[id]=max(ans[id],score[id]+ans[j]);
			}
			int should_check=ss[a[id]+x]-ss[a[id]-x-1];
			if (should_check>100||x>100)
				;else

			for (int j=a[id]-x;j<=a[id]+x;j++)
			{
				for (int q=0;q<v_list[j].size();q++)
				{
					int p=v_list[j][q];
					if (h[p]<cur_h&&abs(a[id]-a[p])<=x&&abs(b[id]-b[p])<=y)
						ans[id]=max(ans[id],score[id]+ans[p]);
				}
			}
			/*for (int j=1;j<=n;j++)
			{
				if (h[j]<cur_h&&abs(a[id]-a[j]<=x)&&abs(b[id]-b[j])<=y)
					ans[id]=max(ans[id],score[id]+ans[j]);
			}*/
			S.insert(make_pair(ans[id],id));
		}
	}

	long long answ=0;
	for (int i=1;i<=n;i++)
		answ=max(answ,ans[i]);
	cout<<answ<<endl;

	cin.get(); cin.get();
	return 0;
}