#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <cctype>

using namespace std;

struct loc
{
    int lat, lon, h, p;
};

bool comp(const loc& r, const loc& l)
{
    return r.h < l.h;
}

int main()
{
    int n, x, y;
    cin>>n>>x>>y;
    loc l[n];
    for(int i = 0; i < n; i++)
        cin>>l[i].lat>>l[i].lon>>l[i].h>>l[i].p;
    sort(l, l + n, comp);
//    for(int i = 0; i < n; i++)
//        cout<<l[i].lat<<" "<<l[i].lon<<" "<<l[i].h<<" "<<l[i].p<<endl;
    int start = -1;
    for(int i = 0; i < n; i++)
    {
        if(l[i].p > 0)
        {
            start = i;
            break;
        }
    }
    if(start == -1)
    {
        cout<<"0\n";
        return 0;
    }
    int ans = 0;
    ans += l[start].p;
    //cout<<start<<endl;
    for(int i = start; i < n - 1;)
    {
        int m = i + 1;
        int mi = -1e9;
        int j = i + 1;
        int flag = 0, flag2 = 0;
        while(j < n && l[j].h == l[i].h)
            j++;
        while(j < n && abs(l[j].lat - l[i].lat) <= x && abs(l[j].lon - l[i].lon) <= y)
        {
            //cout<<"ok";
            flag2 = 1;
            if(l[j].p > 0)
            {
                //cout<<l[j].p;
                flag = 1;
                break;
            }
            else
            {
                if(l[j].p > mi)
                {
                    m = j;
                    mi = j;
                }
            }
            j++;
        }
        if(!flag2)
            break;
       // cout<<ans<<endl;
        if(flag)
            i = j;
        else
            i = mi;
        //cout<<"i: "<<i<<endl;
        ans += l[i].p;
    }
    cout<<ans<<endl;
    return 0;
}