#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
struct node
{
    ll w,l,r;
    node() : w(0), l(0), r(0) {}
    node(ll w1,ll l1,ll r1)
    {
        w = w1;
        l = l1;
        r = r1;
    }
    bool operator < (const node & a) const
    {
        return w > a.w;
    }
};
node b[N];
ll suml[N],sumd[N],sumindex[N],sumLsum[N];
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    ll n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        ll w1,l1,r1;
        cin>>w1>>l1>>r1;
        b[i] = node(w1,l1,r1);
    }
    sort(b+1,b+1+n);
    for(int i=1;i<=n;i++)
    {
        suml[i] = suml[i-1] + b[i].l;
        sumd[i] = sumd[i-1] + (b[i].r - b[i].l)*b[i].w;
        sumindex[i] = sumindex[i-1] + (b[i].r - b[i].l);
        sumLsum[i] = sumLsum[i-1] + b[i].l * b[i].w;
    }
    ll ans = 0;
    for(int i=1;i<=n;i++)
    {
        ll length = m - (suml[n] - suml[i])-suml[i-1];
        ll now = sumLsum[i-1];
        if(sumindex[i-1]<=length)
        {
            now += sumd[i-1] + b[i].w * (length - sumindex[i-1]);
        }else{
            int pos = upper_bound(sumindex,sumindex+i,length) - sumindex - 1;
            now += sumd[pos-1] + (length - sumindex[pos-1])*b[pos].w;
        }
        ans = max(ans,now);
    }
    cout<<ans<<endl;
    return 0;
}