#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
#define int long long
const int N=100005;
struct node{int v,l,r,d;}a[N];
int sml[N],smr[N],sl[N],sr[N],sd[N];
int n,m,ans;
bool cmp(node A,node B){return A.v<B.v;}
signed main(){
	int i;
	scanf("%lld%lld",&n,&m);
	for(i=1;i<=n;i++){
		scanf("%lld%lld%lld",&a[i].v,&a[i].l,&a[i].r);
		a[i].d=a[i].r-a[i].l+1;
	}
	sort(a+1,a+1+n,cmp);
	for(i=1;i<=n;i++){
		sl[i]=sl[i-1]+a[i].l;
		sr[i]=sr[i-1]+a[i].r;
		sd[i]=sd[i-1]+a[i].d;
		sml[i]=sml[i-1]+a[i].l*a[i].v;
		smr[i]=smr[i-1]+a[i].r*a[i].v;
	}
	for(i=1;i<=n;i++){
		int spl=sl[i-1],spr=sr[n]-sr[i];
		if(spl+spr<=m){
			int dlt=m-spl-spr;
			ans=max(ans,sml[i-1]+smr[n]-smr[i]+dlt*a[i].v);
		}
		else{
			int dlt=spl+spr-m;
			int L=i,R=n,rs=L;
			while(L<=R){
				int mid((L+R)>>1);
				if(sd[mid]-sd[i]<=dlt){
					rs=mid,L=mid+1;
				}
				else R=mid-1;
			}
			ans=max(ans,sml[i-1]+sml[rs]-sml[i]+smr[n]-smr[rs]-a[rs+1].v*(dlt-(sd[rs]-sd[i])));
		}
	}
	printf("%lld\n",ans);
}