#include <bits/stdc++.h>
using namespace std;
//premBhai
#define inc(i,n) for(int i=0;i<n;i++)
#define dec(i,n) for(int i=n-1;i>-1;i--)
#define ll long long int
#define mod 1000000007
#define in(n) cin>>n
#define in2(a,b) cin>>a>>b
#define in3(a,b,c) cin>>a>>b>>c
#define pr(x) cout<<x<<'\n'
#define pr2(x,y) cout<<x<<" "<<y<<'\n'
#define pr3(x,y,z) cout<<x<<" "<<y<<" "<<z<<'\n'
#define fill(a,n,x) for(int i=0;i<n;i++) a[i]=x;
#define printArr(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" ";
#define inArr(a,n) for(int i=0;i<n ;i++) cin>>a[i];
#define mp make_pair
#define sz(s) s.size()
#define rev(myvector) reverse(myvector.begin(),myvector.end())
#define pb push_back
#define INF 1000001
#define MAX 200001
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define pdd pair<double,double>
#define PI 3.1415926535
#define tr(v, it,type) for(type::iterator it = v.begin(); it != v.end(); it++) 
#define present(container, element) (container.find(element) != container.end()) 
#define cpresent(container, element) (find(all(container),element) != container.end()) 
#define vpll std::vector<pll>
#include <fstream>
#define prq priority_queue<pll,vector<pll>,greater<pll>>

//g++ -std=c++11 your_file.cpp -o a
//g++ 2.cpp -o Main -fno-asm -Wall -lm --static -std=c++0x -DONLINE_JUDGE
// ./y.out < file.in > file.out
struct loc
{
    int lat,lng,h,pt;
};
bool cmp(loc a,loc b){
    return a.h<b.h;
}
int main(){
    
    std::ios::sync_with_stdio(false);
    ll n,x,y;
    in3(n,x,y);
    loc arr[n];
    for (int i = 0; i < n; ++i)
    {
        in2(arr[i].lat,arr[i].lng);
        in2(arr[i].h,arr[i].pt);
    }
    sort(arr,arr+n,cmp);
    ll ans[n];
    ans[n-1]=arr[n-1].pt;
    ll s=0;
    for(int i=n-2;i>-1;i--){
        ans[i]=arr[i].pt;
        for(int j=i+1;j<n;j++){
            if(arr[j].h>arr[i].h){
                if(abs(arr[j].lng-arr[i].lng)<=y && abs(arr[j].lat-arr[i].lat)<=x){
                    ans[i]=max(ans[i],arr[i].pt+ans[j]);
                }
            }
        }
        s=max(s,ans[i]);
    }
    pr(s);
    return 0;
}