#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define max 100010
#define setzero memset(a,0,sizeof(a))
#define setneg(a) memset(a,-1,sizeof(a))
typedef pair<ll,ll> pii;
typedef vector<ll> vec;
ll dp[max];
struct t
{
	ll xx,yy,h,pt;
};
bool cmp(t t1,t t2)
{
	return t1.h<t2.h;
}
t tree[max];
ll n,x,y;
ll find(ll i)
{
	ll p,q,r,j;
	for(j=i+1;j<n;j++)
	{
		if(abs(tree[j].xx-tree[i].xx)<=x&&abs(tree[j].yy-tree[i].yy)<=y)
		return j;
	}
	return -1;
}
ll maxi(ll a,ll b)
{
	if(a>b)
	return a;
	return b;
}
ll solve(ll i)
{
	if(i>=n)
	return 0;
	if(dp[i]!=-1)
	return dp[i];
	ll inc,exl;
	inc=tree[i].pt;
	ll candi=find(i);
	if(candi!=-1)
	inc=inc+tree[candi].pt+(candi+1);
	exl=solve(i+1);
	return dp[i]=maxi(inc,exl);
	
}
int main()
{
	cin>>n>>x>>y;
	for(ll i=0;i<n;i++)
	{
		cin>>tree[i].h>>tree[i].xx>>tree[i].yy>>tree[i].pt;
	}
	setneg(dp);
	sort(tree,tree+n,cmp);
	cout<<solve(0);
}