#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
using namespace std;
const int N=1e5+10;
struct node
{
    int w,l,r,sum;
}a[N];
bool cmp(node a,node b)
{
    return a.w>b.w||a.w==b.w&&a.l<b.l;
}
void solve()
{
    int n,m;cin>>n>>m;
    int w[n+1],l[n+1],r[n+1];
    int L=0,R=0,S=0;
    for(int i=1;i<=n;i++)
    {
         cin>>a[i].w>>a[i].l>>a[i].r;
        L+=a[i].l;
        R+=a[i].r;
        a[i].sum=a[i].w*a[i].l;
        S+=a[i].sum;
    }
    int ans=0;
    sort(a+1,a+n+1,cmp);
    L-=a[n].l;R-=a[n].r;
    a[n].l=0;a[n].r=m;
    S-=a[n].sum;
    a[n].sum=0;
    ans=S;
    int t=L;
    for(int i=1;i<=n;i++)
    {
        if(t+a[i].r-a[i].l<=m)
        {
            ans+=a[i].w*(a[i].r-a[i].l);
            t+=a[i].r-a[i].l;
        }
        else
        {
            ans+=a[i].w*(m-t);
            break;
        }
    }
    cout<<ans<<'\n';
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t=1;//cin>>t;
    while(t--)
        solve();
}