#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (5555)
#define SZ (200001)
int N,X,Y,dp[MX][MX+1],x[SZ],y[SZ],p[SZ],H[SZ],W[SZ];
int dyn(int u,int l){
    if(u==N)return 0;
    int&v=dp[u][l];
    if(~v)return v;
    v=dyn(u+1,l);
    if(l==N||(abs(x[W[u]]-x[W[l]]<=X&&abs(y[W[u]]-y[W[l]])<=Y&&H[W[u]]>H[W[l]])))v=max(v,p[W[u]]+dyn(u+1,u));
    return v;
}
bool cp(int a,int b){return H[a]<H[b];}
int main(void){
    scanf("%d%d%d",&N,&X,&Y),iota(W,W+N,0);
    F(N)scanf("%d%d%d%d",x+i,y+i,H+i,p+i);
    sort(W,W+N,cp);
    if(N<MX)CL(dp,-1),printf("%d\n",dyn(0,N));
    else printf("%d\n",max(0,*max_element(p,p+N)));
    return 0;
}