#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
struct Node{
	int w,l,r;
	bool operator<(const struct Node&W)const{
		return w>W.w;
	}
}node[100010];
int s[100010],s1[100010],s2[100010];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		int w,l,r;
		cin >> w >> l >> r;
		node[i]={w,l,r};
		m-=l;
	}
	sort(node+1,node+1+n);
	for(int i=1;i<=n;i++){
		int w=node[i].w,l=node[i].l,r=node[i].r;
		s[i]=s[i-1]+r-l;
		s1[i]=s1[i-1]+r*w;
		s2[i]=s2[i-1]+l*w;
//		cout << w << " " << l << " " << r << endl;
	}
	int res=0;
	for(int i=1;i<=n;i++){
		int w=node[i].w,l=node[i].l,r=node[i].r;
		int rest=m+l;
		int left=0,right=n;
		while(left<right){
			int mid=(left+right)/2+1;
			int cost=s[mid];
			if(mid>=i) cost+=l;
			if(cost<=rest) left=mid;
			else right=mid-1;
		}
		int revenue=s1[right];
		rest-=s[right];
		if(right>=i) rest-=l;
		right++;
		if(right==i) revenue+=w*rest;
		else revenue+=node[right].w*(node[right].l+rest);
		if(right<n){
			revenue+=s2[n]-s2[right];
			if(right<i) revenue-=l*w;
		}		
//		cout << w << " " << l << " " << r << " " << right << " " << revenue << endl;
		res=max(res,revenue);
	}
	cout << res;
	return 0;
}