#include <bits/stdc++.h>
#define ll long long
using namespace std;

void work() {
    ll n, m;
    cin >> n >> m;
    vector<pair<ll,ll>> v_mp;
    vector<pair<ll, ll>> w_used;
    ll total = 0, used_time = 0, remaining_w = 0, w0, l, r, max_w = 0;
    
    for(ll i = 0; i < n; i++){
        cin >> w0 >> l >> r;
        total += w0 * l;
        used_time += l;
        remaining_w += r - l;
        if (r - l != 0) v_mp.push_back(make_pair(w0, r - l));
        if (l != 0) w_used.push_back(make_pair(w0, l));
        max_w = max(w0, max_w);
    }
    
    sort(v_mp.begin(), v_mp.end(), greater<pair<ll, ll>>());
    
    vector<ll> acc_sum;
    ll acc = 0;
    
    for (const auto &p : v_mp) {
        for(int i = 0; i < p.second; i++) {
            acc += p.first;
            acc_sum.push_back(acc);
        }
    }
    
    ll remaining_time = m - used_time;
    ll max_gain = remaining_time * max_w;
    
    for(auto x : w_used){
        ll max_replace = min(remaining_w - remaining_time, x.second);
        for(int i = max_replace; i >= 0; i--){
            max_gain = max(max_gain, acc_sum[i + remaining_time - 1] - x.first * i);
        }
    }
    
    cout << max_gain + total << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    work();
    return 0;
}