#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define INF 2000000000
//
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define mod 1000000007
#define mp make_pair
//#define pi acos(-1.0)
//#define V 202
#define rep(i,a,b) for(int i=a;i<=b;i++)
//#define maxn 100005
//#define MAX_NUMBER_OF_NODES 100005
//#define MAX_ASCII_CODE 26
#define pi acos(-1.0)
#define pll pair<ll,ll>

ll Set(ll N,ll p){return N | (1<<p);}
ll reset(ll N,ll p){return  N & ~(1<<p);}
bool check(ll N,int p){ll fuck = 1;return (bool)(N & (fuck<<p));}
//int mod;

//map<ll,bool>asol;
//int Left[1000001],Right[1000001];

struct data
{
    ll la,lo,he,p;
};

data yuki[200001];

bool cmp(data a,data b)
{
    return a.he<b.he;
}

int n;
ll dp[200001];
bool vis[200001];
ll x,y;

ll rec(int ind)
{
    bool &b = vis[ind];

    if(b==1)return dp[ind];
    b=1;
    ll &r = dp[ind];
    r = yuki[ind].p;

    rep(i,ind+1,n)
    {
        if(abs(yuki[i].la-yuki[ind].la)<=x and abs(yuki[i].lo-yuki[ind].lo)<=y)r = max(r,yuki[ind].p+rec(i));
    }

    return r;
}

int main()
{
    cin>>n>>x>>y;
    rep(i,1,n)
    {
        ll la,lo,he,p;
        scanf("%lld%lld%lld%lld",&la,&lo,&he,&p);
        yuki[i].la=la;
        yuki[i].lo=lo;
        yuki[i].he=he;
        yuki[i].p=p;
    }
    sort(yuki+1,yuki+n+1,cmp);

    ll ans = -10000000000000000;
    rep(i,1,n)ans = max(ans,rec(i));

    cout<<max(ans,0ll)<<endl;
}