#include<bits/stdc++.h>
#define int long long
#include<cmath>
using namespace std;
int n,m,c,inter=pow(2,31)-1;
struct node
{
    int t;
    int z;
    int k;
}a[1005];
bool cmp(node a,node b)
{
    if(b.t<a.t)
    {
        return 1;
    }
    else if(b.t>a.t)
    {
        return 0;
    }
    else
    {
         if(b.z<a.z)
        {
            return 1;
        }
        else if(b.z>a.z)
        {
            return 0;
        }
        else
        {
            if(b.t<a.t)
            {
                return 1;
            }
            else
            {
                return 0;
            }
        }   
    }
}
signed main()
{
    cin>>n>>m;
    cin>>c;
    for(int i=0;i<n;i++)
    {
        cin>>a[i].t>>a[i].z>>a[i].k;
    }
    sort(a,a+n,cmp);
    int y=0,q=0,p=0,i=0;
    while(q>=n||p>=m||(y+a[i].k)>inter||i+1==c)
    {
        y+=a[i].k;
        q+=a[i].t;
        p+=a[i].z;
        i++;
    }
    if(q>n||p>m)
    {
        cout<<y-a[i].k;
        return 0;
    }
    cout<<y;
    return 0;
}