#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,m,ans;
struct nd{
	int a,l,r;
}a[maxn];
int t[maxn],f[maxn],g[maxn];
void work(){
	n=read();m=read();int mx=0;
	for(int i=1;i<=n;i++)a[i]={read(),read(),read()};
	sort(a+1,a+n+1,[&](nd u,nd v){return u.a>v.a;});
	int sum=0,cur=0;
	for(int i=1;i<=n;i++)t[i]=a[i].l,sum+=a[i].a*a[i].l,cur+=a[i].l;
	for(int i=1;i<=n;i++){
		int d=min(m-cur,a[i].r-a[i].l);
		t[i]+=d,sum+=a[i].a*d,cur+=d;
	}
	ans=sum+a[1].a*(m-cur);
	for(int i=1;i<=n;i++){
		f[i]=f[i-1]+(a[i].r-t[i]);
		g[i]=g[i-1]+(a[i].r-t[i])*a[i].a;
	}
	for(int i=1;i<=n;i++){
		int d=m-cur+t[i];
		int p=upper_bound(f+1,f+n+1,d)-f-1;
		// cout<<ans<<" "<<i<<" "<<p<<" "<<sum-t[i]*a[i].a+g[p]+(p<i?(d-f[p])*a[p+1].a:(d-f[p])*a[i].a)<<"\n";
		ans=max(ans,sum-t[i]*a[i].a+g[p]+(p<i?(d-f[p])*a[p+1].a:(d-f[p])*a[i].a));
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}