#include <bits/stdc++.h>

using namespace std;
#define int long long
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAXX = 2e5 + 10;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
void solve() {
    int n,m;
    cin >> n >> m;
    vector<array<int,3>>a(n + 5);
    for(int i = 1;i <= n;i++){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    sort(a.begin() + 1,a.begin() + n + 1,greater<>());
    vector<int>cnt(n + 5);
    int sum = 0;
    int temp = 0;
    for(int i = 1;i <= n;i++){
        auto [w,l,r] = a[i];
        cnt[i] = l;
        temp += cnt[i];
    }
    for(int i = 1;i <= n;i++){
        auto [w,l,r] = a[i];
        if(temp < m){
            int t = min(r - cnt[i],m - temp);
            cnt[i] += t;
            temp += t;
        }
        sum += cnt[i] * w;
    }
    vector<int>pre;
    pre.push_back(0);
    vector<int>suf;
    suf.push_back(0);
    vector<int>preli(n + 5);
    vector<int>sufli(n + 5);
    for(int i = 1;i <= n;i++){
        auto [w,l,r] = a[i];
        preli[i] = pre.size() - 1;
        int t = cnt[i];
        while(pre.size() <= 1e6 + 5 && t < r){
            pre.push_back(pre[pre.size() - 1] + w);
            t++;
        }
    }
    for(int i = n;i >= 1;i--){
        auto [w,l,r] = a[i];
        sufli[i] = suf.size() - 1;
        int t = cnt[i];
        while(suf.size() <= 1e6 + 5 && t > l){
            suf.push_back(suf[suf.size() - 1] + w);
            t--;
        }
    }
    int ans = sum;
    for(int i = 1;i <= n;i++){
        auto [w,l,r] = a[i];
        int t = sum;
        t += pre[min(preli[i], cnt[i])];
        t -= min(preli[i], cnt[i]) * w;
        t -= suf[min(sufli[i], m)];
        t += min(sufli[i], m) * w;
        ans = max(ans,t);
    }
    cout << ans << "\n";
}

signed main() {
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}