#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<pair<ll, pair<ll, ll>>> a(n+1);
    ll sum = 0, num = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].first >> a[i].second.first >> a[i].second.second;
        sum += a[i].second.first * a[i].first;
        num += a[i].second.first;
    }
    sort(a.begin()+1, a.end());
    ll b[n+2]={0},c[n+2]={0};
    for(int i=n;i>=1;i--)
    {
        b[n-i+1]=b[n-i]+a[i].second.second-a[i].second.first;
        c[n-i+1]=c[n-i]+(a[i].second.second-a[i].second.first)*a[i].first;
    }
    ll ma=0,pos=0;
    // for(int i=1;i<=n;i++)
    // cout<<b[i]<<' ';
    // cout<<endl;
    // for(int i=1;i<=n;i++)
    // cout<<c[i]<<' ';
    // cout<<endl;
    for (int i = 1; i <= n; i++)
    {
        int l=1,r=n;
        while(l+1<r)
        {
            int mid=(l+r)/2;
            if(b[mid]<a[i].second.first+m-num)
            {
                r=mid;
            }
            else {
                l=mid;
            }
        }
        // cout<<a[i].second.first+m-num<<' '<<l<<endl;
        if(n-l<i)
        break;
        if(ma<(sum+c[l]+(a[i].second.first+m-num-b[l])*a[n-l].first))
        {
            ma=(sum+c[l]+(a[i].second.first+m-num-b[l])*a[n-l].first);
            pos=i;
        }
    }
    ll a1 = sum + (m - num) * a.back().first;
    ll a2 = sum - a[pos].first * a[pos].second.first;
    m -= num - a[pos].second.first;
    for (int i = n; i >= 1; i--)
    {
        if (i == pos)
            {
                a2+=m*a[i].first;
                break;
            }
        if (m < a[i].second.second - a[i].second.first)
        {
            a2 += m * a[i].first;
            m = 0;
            break;
        }
        else
        {
            a2 += (a[i].second.second - a[i].second.first) * a[i].first;
            m -= a[i].second.second - a[i].second.first;
        }
    }
    // cout<<a1<<' '<<a2<<'\n';
    cout << max(a1, a2);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}