#include<bits/stdc++.h>
using namespace std;
struct qq{
    int lose;
    int win;
    int use;
}p[1005];
int main(){
    int a,b,dp[105][105],ans;
    scanf("%d%d",&a,&b);
    for (int i=1;i<=a;i++)
    	scanf("%d%d%d",&p[i].lose,&p[i].win,&p[i].use);
    for (int i=1;i<=a;i++){
        for (int j=1;j<=b;j++){
            if (b<p[i].use) dp[i][j]+=p[i].lose;
            else dp[i][j]=max(dp[i-1][j]+p[i].lose,dp[i-1][j-p[i].use]+p[i].win);
        }
    }
    printf("%d",dp[a][b]*5);

}

求助