#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

#define ll long long
ll x, y;
bool func(vector<ll> v1, vector<ll> v2)
{
    return abs(v1[0]- v2[0]) <= x && abs(v1[1]- v2[1]) <= x && v1[2] < v2[2] && v1[3] > v2[3];
}    

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    ll n;
    cin >> n >> x >> y;
    vector<vector<ll>> c(n);
    for(int i=0; i<n; i++)
    {   
        ll tp1, tp2, tp3, tp4;
        cin >> tp1 >> tp2 >> tp3 >> tp4;
        c[i].push_back(tp1);
        c[i].push_back(tp2);
        c[i].push_back(tp3);
        c[i].push_back(tp4);
    }
    
    sort(c.begin(), c.end(), func);
    
    ll maxp = 0, p = c[0][3];
    vector<ll> v1 = c[0];
    
    for(int i=1; i<n; i++)
    {    
        if(abs(v1[0]- c[i][0]) <= x && abs(v1[1]- c[i][1]) <= x && v1[2] < c[i][2]) 
        {
            p += c[i][3];
            v1 = c[i];
        }
        else
        {
            maxp = max(maxp, p);
            p = c[i][3];
            v1 = c[i];
        }
    }
    
    maxp = max(maxp, p);
    cout << maxp << endl;
    
    return 0;
}