#include<cstdio>
#include<algorithm>
#include<iostream>
#define INF 0x3f3f3f3f
typedef long long ll;
int n;
ll m,ans,ts[100010],ps[100010];
struct crop{
	ll w,ex,minn;
	bool operator<(const crop &t)const{
		return t.w<w;
	}
}p[100010];
using std::cin;
int main(){
	ll x,y,z;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		scanf("%lld%lld%lld",&x,&y,&z);
		m-=y;
		ans+=x*y;
		p[i].ex=z-y;
		p[i].minn=y;
		p[i].w=x;
		ts[i]=ts[i-1]+p[i].ex;
		ps[i]=ps[i-1]+p[i].ex*p[i].w;
	}
	std::sort(p+1,p+n+1);
	int sum=ans;
	ans+=p[1].w*m;
	//printf("%d",ans);
 	for(int i=n;i>0;i--){
		//printf("%d\n",i);
		if(ts[i]<=m)break;
 		m+=p[i].minn;
 		int l=1,r=n,mid,qwq=n;
 		while(l<=r){
 			mid=l+r>>1;
 			if(ts[mid]>m)qwq=mid,r=mid-1;
 			else l=mid+1;
		}
		ans=std::max(ans,sum+ps[qwq]-p[qwq].w*(ts[qwq]-m)-p[i].minn*p[i].w);
	}
	printf("%lld",ans); 
	return 0;
}
/*
 5 17
 2 3 4
 6 1 5
 8 2 4
 4 3 3
 7 5 5
*/