#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}

const int maxn=111111;
ll A[maxn],L[maxn],R[maxn],id[maxn];
ll sumt[maxn],sumv[maxn];

bool cmp(int x,int y)
{
	return A[x]<A[y];
}

int main()
{
	ll N=read(),M=read();
	for(int i=1;i<=N;++i) A[i]=read(),L[i]=read(),R[i]=read(),id[i]=i;
	sort(id+1,id+1+N,cmp);
	for(int ii=N;ii>=1;--ii)
	{
		int i=id[ii];
		sumt[i]=sumt[i+1]+R[i]-L[i];
		sumv[i]=sumv[i+1]+(ll)(R[i]-L[i])*A[i];
	}
	ll ANS=0,tott=0,totv=0;
	for(int i=1;i<=N;++i) tott+=L[i],totv+=L[i]*A[i];
	for(int ii=1;ii<=N;++ii)
	{
		int i=id[ii];
		int l=i+1,r=N,ans=N+1;
		while(l<=r)
		{
			int mid=(l+r)/2;
			if(sumt[mid]+tott-L[i]<=M) ans=mid,r=mid-1;
			else l=mid+1;
		}
		ANS=max(ANS,totv-(ll)L[i]*A[i]+sumv[ans]+A[ans-1]*(M-(sumt[ans]+tott-L[i])));
	}
	cout<<ANS;
	return 0;
}