#include <bits/stdc++.h>

using namespace std;
using LL = long long;

void solved(){
    LL n , m;
    cin >> n >> m;

    vector<array<LL , 3>> a(n + 1);
    for(int i = 1 ; i <= n ; i ++ )
        for(int j = 0 ; j < 3 ; j ++ )
            cin >> a[i][j];
    std::sort(a.begin() + 1, a.end() , [&](auto a , auto b){
        return a[0] > b[0];
    });

//    for(int i = 1 ; i <= n ; i ++ , cout << "\n")
//        for(int j = 0 ; j < 3 ; j ++ )
//            cout << a[i][j] << " ";

    vector<LL> R(n + 10) , L(n + 10) , l(n + 10) , r(n + 10);
    for(int i = 1 ; i <= n ; i ++ )
        R[i] = R[i - 1] + a[i][2] * a[i][0] , r[i] = r[i - 1] + a[i][2];
    for(int i = n ; i ; i -- )
        L[i] = L[i + 1] + a[i][1] * a[i][0] , l[i] = l[i + 1] + a[i][1];

    LL ans = 0;

    for(int i = 1 ; i <= n ; i ++ ){
        LL sum = l[i + 1] + r[i - 1];
        if(sum <= m){
            ans = max(ans , L[i + 1] + R[i - 1] + (m - sum) * a[i][0]);
//            cout << ans << "____\n";
        }else {
            int l1 = 1 , r1 = i - 1;
            LL k = m - l[i + 1];
            while(l1 < r1){
                int mid = (l1 + r1 + 1) >> 1;
                LL s = r[mid - 1] + l[mid] - l[i];
                if(s > k) r1 = mid - 1;
//                else if(k - s <= a[mid][2] - a[mid][1]) {
//                    ans = max(ans , R[mid - 1] + L[mid + 1] - a[i][0] * a[i][1] + (k - s) * a[mid][0]);
//                    cout << mid << " " << R[mid - 1] + L[mid + 1] - a[i][0] * a[i][1] + (k - s) * a[mid][0] << endl;
//                    break;
//               }
                else l1 = mid;
            }
            LL s = r[l1 - 1] + l[l1] - l[i];
            ans = max(ans , R[l1 - 1] + L[l1] - a[i][0] * a[i][1] + (k - s) * a[l1][0]);

        }

//        cout << ans << "\n";
    }

    cout << ans << "\n";
}

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
//    cin >> t;

    while(t -- )
        solved();

    return 0;
}