closefrom

//My AC Code:
#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,x,fm[1005][1005];
struct node{
    int a,b,c;
}nn[105];
int max(int a,int b){return a>b?a:b;}
int main(){
    scanf("%d%d%d",&n,&m,&x);
    for(int i=1;i<=n;i++)scanf("%d%d%d",&nn[i].a,&nn[i].b,&nn[i].c);
    for(int i=1;i<=n;i++)
        for(int j=m;j>=nn[i].b;j--)
            for(int k=x;k>=nn[i].c;k--)
                fm[j][k]=max(fm[j][k],fm[j-nn[i].b][k-nn[i].c]+nn[i].a);
    
    printf("%d",fm[m][x]);
    return 0;
}