#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);
    ll sum=0,num=0;
    for (int i = 0; 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;
        }
    vector<pair<long double,int>> b(n);
    for(int i=0;i<n;i++)
    {
        b[i]={1.0*a[i].first/a[i].second.first,i};
    }
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    ll a1 = sum+(m-num)*a.back().first;
    ll a2=sum-a[b[0].second].first*a[b[0].second].second.first;
    m-=num-a[b[0].second].second.first;
    while (m)
    {
        auto p = b.back();
        if (m < a[p.second].second.second-a[p.second].second.first)
        {
            a2 += m * a[p.second].first;
            m = 0;
        }
        else
        {
            a2 += (a[p.second].second.second-a[p.second].second.first) * a[p.second].first;
            m -= a[p.second].second.second-a[p.second].second.first;
        }
        b.pop_back();
    }
    // 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;
}