#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;
    // cin>>a[0].first>>a[0].second.first>>a[0].second.second;
    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;
        }
    sort(a.begin(), a.end());
    ll a1 = sum+(m-num)*a.back().first;
    ll a2=sum-a[0].first*a[0].second.first;
    m-=num-a[0].second.first;
    while (m)
    {
        auto p = a.back();
        if (m < p.second.second-p.second.first)
        {
            a2 += m * p.first;
            m = 0;
        }
        else
        {
            a2 += (p.second.second-p.second.first) * p.first;
            m -= p.second.second-p.second.first;
        }
        a.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;
}