#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define ub upper_bound
#define dbg(x) cerr<<"In Line "<<__LINE__<<' '<<#x<<" = "<<(x)<<endl
struct node{
	int w,l,r,now;
}a[100005];
bool cmp(node x,node y){
	return x.w<y.w;
}
ll b[100005],c[100005];
int d[100005];
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;ll m;cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i].w>>a[i].l>>a[i].r;
	sort(a+1,a+n+1,cmp);
	ll now=m,sum=0,ans=0;
	for(int i=1;i<=n;i++) now-=a[i].l,sum+=(ll)a[i].l*a[i].w;
	int cnt=0;
	for(int i=n;i;i--){
		if(now>a[i].r-a[i].l){
			a[i].now=a[i].r-a[i].l,sum+=(ll)a[i].w*a[i].now,now-=a[i].now;
			ans=max(ans,sum+now*a[i].w);
		}
		else{
			a[i].now=now,now=0,sum+=(ll)a[i].w*a[i].now;
			int p=ub(b+1,b+cnt+1,a[i].l+a[i].now)-b-1;
			d[++cnt]=a[i].w;
			ans=max(ans,sum-(ll)(a[i].l+a[i].now)*a[i].w+c[p]+(a[i].l+a[i].now-b[p])*d[p+1]);
			b[cnt]=a[i].r-a[i].l-now;
			c[cnt]=b[cnt]*a[i].w;
			b[cnt]+=b[cnt-1],c[cnt]+=c[cnt-1];
		}
	}
	cout<<ans;
}