#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
ll n,x;
ll win[10010];
ll lose[10010];
ll use[10010];
ll ans[10010][10010];
ll dp(ll i,ll space)
{
    if(ans[i][space]) return ans[i][space];
    if(i==0) return 0;
    if(space>=use[i])ans[i][space]=max(dp(i-1,space)+lose[i],dp(i-1,space-use[i])+win[i]);
    else  ans[i][space]=ans[i-1][space]+lose[i];
    return ans[i][space];
}
int main() {
    scanf("%lld%lld",&n,&x);
    for (int i=1; i<=n; i++) {
        scanf("%lld%lld%lld",&lose[i],&win[i],&use[i]);
    }
    printf("%lld",5*dp(n, x));
    return 0;
}