#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
#include<queue>
using namespace std;

bool ss(pair< pair<int, int>, pair<int, int> > l, pair< pair<int, int>, pair<int, int> > r) {
  if (l.first != r.first)
    return l.first < r.first;
  if (l.first.second != r.first.second)
    return l.first.second < r.first.second;
  if (l.second.first != r.second.first)
    return l.second.first < r.second.first;
  return l.second.second < r.second.second;
}

int main(void) {

  int n, x, y;
  cin >> n >> x >> y;
  vector< pair< pair<int, int>, pair<int, int> > > p(n);
  for(int i=0; i<n; i++){
    cin >> p[i].first.first >> p[i].first.second >> p[i].second.first >> p[i].second.second;
  }
  sort(p.begin(), p.end(), ss);

  int nla = 0, nlo = 0, nh = 0, np = 0;
  for(int i=0; i<n; i++){
    if( abs(nla-p[i].first.first) <= x && abs(nlo-p[i].first.second) <= y && nh < p[i].second.first ){
      nla = p[i].first.first;
      nlo = p[i].first.second;
      nh = p[i].second.first;
      np += p[i].second.second;
    }
  }
  cout << np << endl;

  return 0;
}