#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int N=1e5+10;
struct node{
	ll l,r,w;
}a[N];
bool cmp(node p,node q)
{
	return p.w>q.w;
}
int main()
{
	IOS;
	ll n,m;
	cin>>n>>m;
	ll sum=0,ans=0,cnt=0,cnt1=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].w>>a[i].l>>a[i].r;
		ans+=(a[i].l*a[i].w);
		cnt+=a[i].l;
		sum+=(a[i].r*a[i].w);
		cnt1+=a[i].r;
	}
	sort(a+1,a+1+n,cmp);
	ll t=m-cnt;
	ans+=(a[1].w*t);
	ll t1=cnt1-m;
	if(t1<=a[n].r)
	{
		sum-=(t1*a[n].w);
	}
	else
	{
		sum-=(a[n].r*a[n].w);
		t1-=a[n].r;
		for(int i=n-1;i>=1;i--)
		{
			ll x=min(a[i].r-a[i].l,t1);
			sum-=(x*a[i].w);
			t1-=x;
		}
	}
	cout<<max(sum,ans)<<"\n";
	return 0;
}