#include<bits/stdc++.h>
#define ll long long
#define maxn 1000010
using namespace std;
struct node{
	ll w;
	ll l,r;
}a[maxn];
ll suml[maxn],sumr[maxn],sumvall[maxn],sumvalr[maxn];
ll n,m;
bool cmp(node a,node b){
	return a.w<b.w;
}
ll cal(ll x){
	if(sumr[n]-sumr[x]+suml[x-1]<=m){
		return sumvalr[n]-sumvalr[x]+sumvall[x-1]+(m-(sumr[n]-sumr[x]+suml[x-1]))*a[x].w;
	}
	else{
		ll l=x,r=n+1;
		while(l+1!=r){
			ll mid=(l+r)>>1;
			if(suml[mid]+sumr[n]-sumr[mid]-a[x].l>=m) r=mid;
			else l=mid;
		}
		return sumvall[l-1]-a[x].l*a[x].w+sumvalr[n]-sumvalr[l]+(m-(suml[l-1]+sumr[n]-sumr[l]))*a[x].w;
	}
}
void slove(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld%lld%lld",&a[i].w,&a[i].l,&a[i].r);
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		suml[i]=suml[i-1]+a[i].l;
		sumr[i]=sumr[i-1]+a[i].r;
		sumvall[i]=sumvall[i-1]+a[i].l*a[i].w;
		sumvalr[i]=sumvalr[i-1]+a[i].r*a[i].w;
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		ans=max(ans,cal(i));
	}
	printf("%lld",ans);
	return ;
}
int main(){
	int T=1;
//	scanf("%d",&T);
	while(T--) slove();
	return 0;
}