#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;



void solve() {
    ll n,m;
    cin >> n >> m;
    vector<array<ll,3>> a(n + 1);
    for(int i = 1;i <= n;i ++){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    sort(a.begin() + 1,a.end());
    vector<ll> preL(n + 2),sufR(n + 2),preLw(n + 2),sufRw(n + 2);
    for(int i = 1;i <= n;i ++){
        preL[i] = preL[i - 1] + a[i][1];
        preLw[i] = preLw[i - 1] + a[i][0] * a[i][1];
    }
    sufR[n] = a[n][2];
    sufRw[n] = a[n][0] * a[n][2];
    for(int i = n - 1;i >= 1;i --){
        sufR[i] = sufR[i + 1] + a[i][2];
        sufRw[i] = sufRw[i + 1] + a[i][0] * a[i][2];
    }
    ll ans = 0;
    for(int i = 1;i <= n;i ++){
        ll tmp = preL[i - 1] + sufR[i + 1];
        if(tmp <= m){
            ans = max(ans,preLw[i - 1] + sufRw[i + 1] + a[i][0] * (m - tmp));
        }else {
            int l = i + 1, r = n;
            while(l < r){
                int mid = l + r >> 1;
                ll res = preL[mid] - a[i][1] + sufR[mid + 1];
                if(res >= m) r = mid;
                else l = mid + 1;
            }
            ll cnt = m - (preL[l] + sufR[l + 1] - a[i][1]);
            // assert(cnt >= 0 && cnt < a[i][2] - a[i][1]);
            ll ress = preLw[l] + sufRw[l + 1] - a[i][0] * a[i][1] + cnt * a[l][0];
            ans = max(ans,ress); 
        }

    }
    cout << ans << '\n';
    // for(int i = 1;i <= n;i ++)
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int t = 1;
    // cin >> t;b
    while(t -- ) {
        solve();
    }
    
    return 0;
}