#include<bits/stdc++.h>
using namespace std;
struct node{
	long long lose,win,use;
}v[1111];
long long n,x;
bool cmp(node x,node y){
	if(x.use!=y.use) return x.use<y.use;
	else return x.win>y.win;
}
int main(){
	cin>>n>>x;
	for(int i=1;i<=n;i++){
		cin>>v[i].lose>>v[i].win>>v[i].use;
	}
	int sum=0;
	sort(v+1,v+1+n,cmp);
	for(int i=1;i<=n;i++){
		if(x>v[i].use){
			if(v[i].lose>=v[i].win){
				sum+=v[i].lose;
			}
			else{
				sum+=v[i].win;
				x-=v[i].use;
			}
			
		}
		else{
			sum+=v[i].lose;
			x=0;
		}
	}
	cout<<sum*5;
	return 0;
}

各位大佬帮我康康吧

orz