#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
#define ull unsigned long long
#define lowbit(x) x&-x
#define lc p<<1
#define rc p<<1|1
#define PII pair<int,int>
#define vi vector<int>
#define int long long

using namespace std;
const ll inf = 2e18;
const int mod = 998244353;
const int N = 1e6+10;
struct node{
    int w,l,r;
    bool operator<(node const &o)const{
        return w<o.w;
    }
};
void solve()
{
    int n;
    ll m;
    cin >> n>> m;
    vector<node>a(n+1);
    for(int i = 1;i<=n;i++)
    {
        cin >> a[i].w >> a[i].l>>a[i].r;
    }
    sort(a.begin(),a.end());
    reverse(a.begin()+1,a.end());
    ll base = 0;
    vi s(n+1);
    for(int i = 1;i<=n;i++)
    {
        base += a[i].w * a[i].l;
        s[i] = s[i-1] + a[i].w * a[i].l;
        m-=a[i].l;
    }
    vi pre(n+1),pre_val(n+1);
    for(int i = 1;i<=n;i++)
    {
        pre[i] = pre[i-1] + (a[i].r - a[i].l);
        pre_val[i] = pre_val[i-1] + (a[i].r-a[i].l)*a[i].w;
    }
    int ans = 0;
    for(int i = 1;i<=n;i++)
    {
        //case 1:全给i
        int u = m+a[i].l;
        if(u>=pre[i-1])
        {
            u-=pre[i-1];
            int x = base-a[i].l*a[i].w+pre_val[i-1];
            x+=u*a[i].w;
            ans = max(ans,x);
        }
        else
        {
            int pos = upper_bound(alls(pre),u) - pre.begin()-1;
            u-=pre[pos];
            int x = base + pre_val[pos] + u*a[pos+1].w;
            ans =  max(ans,x);
        }
    }
    cout<<ans<<'\n';
}
signed main()
{
    cout<<fixed<<setprecision(6);
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while(_--)solve();
}