#include <bits/stdc++.h>

using namespace std;

void swap(int* a, int* b)
{
    int t = *a;
    *a = *b;
    *b = t;
}

int partition (int arr[], int low, int high)
{
    int pivot = arr[high];    
    int i = (low - 1);
 
    for (int j = low; j <= high- 1; j++)
    {
        if (arr[j] <= pivot)
        {
            i++;    
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(int arr[], int low, int high) 
{
    if (low < high)
    {
       int  pi = partition(arr, low, high);

        quickSort(arr, low, pi - 1);  
        quickSort(arr, pi + 1, high); 
    }
}

int main(){
    int n;
    int x;
    int y;
    cin >> n >> x >> y;
    int la[1000000];
    int lo[1000000];
    int h[1000000];
    int p[1000000];
    for(int i = 0; i < n; i++){
        cin >> la[i] >> lo[i] >> h[i] >> p[i];
        // your code goes here
    }
    quickSort(h,0,n-1);
    int sum=0;
    for(int i=0;i<n;i++)
    {
        sum+=p[i];
    }
    cout<<sum;
    return 0;
}