#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,x;
ll lose[1001];
ll win[1001];
ll use[1001];
ll f[1001];
int main(void){
	scanf("%lld%lld",&n,&x);
	for(int i=1;i<=n;i++)scanf("%lld%lld%lld",&lose[i],&win[i],&use[i]);
	for(int i=1;i<=n;i++){
		for(int j=x;j>=0;j--){
			f[j]=max(f[j],f[j]+lose[i]);
			if(j>=use[i])f[j]=max(f[j],f[j-use[i]]+win[i]);
		}
	}
	cout<<f[x]*5;
	return 0;
}