#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
const int mx=1e6;
ll a[N<<2],siz[N<<2];
#define ls ((p)<<1)
#define rs ((p)<<1|1)
#define mid ((x+y)>>1)
void mdf(int x,int y,int idx,int v,int p){
	if(x==y){
		a[p]+=(ll)v*x;
		siz[p]+=v;
		return;
	}
	if(idx<=mid)mdf(x,mid,idx,v,ls);
	else mdf(mid+1,y,idx,v,rs);
	a[p]=a[ls]+a[rs];
	siz[p]=siz[ls]+siz[rs];
}
ll qry(int x,int y,ll k,int p){
	if(x==y)return (ll)k*x;
	if(siz[rs]>=k)return qry(mid+1,y,k,rs);
	else return qry(x,mid,k-siz[rs],ls)+a[rs];
}
int n;ll m;
int l[N],r[N],w[N];
ll sum,mm;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		scanf("%d%d%d",&w[i],&l[i],&r[i]);
		mdf(1,mx,w[i],r[i]-l[i],1);
		sum+=(ll)w[i]*l[i],mm+=l[i];
	}
	ll ans=0;
	for(int i=1;i<=n;++i){
		sum-=(ll)w[i]*l[i],mm-=l[i];
		mdf(1,mx,w[i],l[i]-r[i]+m,1);
		ans=max(ans,qry(1,mx,m-mm,1)+sum);
		sum+=(ll)w[i]*l[i],mm+=l[i];
		mdf(1,mx,w[i],r[i]-l[i]-m,1);
	}
	cout<<ans;
}