#include<bits/stdc++.h>
using namespace std;
struct item
{
    int a,b,c;
};
int n,a,b;
long long maxs=-1;
vector<item>v;
void recursion(int index,int aload,int bload,int value)
{
    if(aload>a||bload>b||index>=v.size())
    {
        return;
    }
    if(value>maxs)
    {
        maxs=value;
    }
    recursion(index+1,aload+v[index].a,bload+v[index].b,value+v[index].c);
    recursion(index+1,aload,bload,value);
}
int main(void)
{
    cin>>n>>a>>b;
    for(int i=0;i<n;i++)
    {
        item temp;
        cin>>temp.a>>temp.b>>temp.c;
        v.emplace_back(temp);
    }
    recursion(0,0,0,0);
    cout<<maxs<<endl;
}