#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second

#define int LL
using LL = long long;

void solve() {
    int n,m;
    cin>>n>>m;
    vector<pair<int,pair<int,int> > >vp(n+1);
    for(int i=0;i<n;i++)cin>>vp[i].fi>>vp[i].se.fi>>vp[i].se.se;
    sort(vp.begin(),vp.end());
    int r1 = 0;
    int _ = m;
    for(int i=1;i+1<vp.size();i++) {
        r1 += vp[i].se.fi * vp[i].fi;
        _ -= vp[i].se.fi;
    }
    r1 += vp.back().fi * _;
    vector<int> ll(n+1), rr(n+1);
    vector<int> lll(n+1), rrr(n+1);
    for(int i=1;i<=n;i++) {
        ll[i] = ll[i-1] + vp[i].se.fi;
        rr[i] = rr[i-1] + vp[i].se.se;
        lll[i] = lll[i-1] + vp[i].se.fi * vp[i].fi;
        rrr[i] = rrr[i-1] + vp[i].se.se * vp[i].fi;
    }
    for(int i=1;i+1<n;i++) {
        int l = i;
        int r = n+1;
        int d = vp[i].se.fi;
        while(l+1 < r) {
            int mid = (l+r)/2;
            int ss = 0;
            ss += ll[mid-1];
            ss += rr[n] - rr[mid];
            if(i < mid) ss -= ll[i];
            if(m-ss > vp[i].se.se)r = mid;
            else l = mid;
        }
        // l 居中的位置
        int rrrr = 0;
        rrrr += lll[l-1];
        rrrr += rrr[n] - rrr[l];
        int ss = 0;
        ss += ll[l-1];
        ss += rr[n] - rr[l];
        if(l != i) {
            ss -= vp[i].se.fi;
            rrrr -= vp[i].se.fi * vp[i].fi;
        }
        rrrr += (m-ss) * vp[l].fi;
        r1 = max(rrrr,r1);
    }
    cout<<r1<<endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}