/*
Undo the destiny.
*/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define ll long long
int n,m;
#define pii pair<ll,ll>
#define mp make_pair
const int N = 1e5 + 10;
pair<ll,pii> p[N];
ll ans,res,pre[N],finans,val[N];

void solve(int x) {
    ll nowres = res + p[x].second.first;
    ll now = ans - p[x].second.first * p[x].first;
    int l=0,r=x-1;
    while(l<r){
        int mid=(l+r+1)/2;
        if(pre[mid]<=nowres) l=mid;
        else r=mid-1;
    }
    int pos = l;
    //cout <<"debug:x:" <<x << "nowres:" << nowres << "now:"<<now<< "pos:"<<pos <<"pre[pos]:"<<pre[pos]<<"\n";
    now += val[pos];nowres -= pre[pos];
    if (pos < (x-1)) {
        if (nowres) now += p[pos+1].first* min(nowres,(pre[pos+1]-pre[pos])),nowres -= min(nowres,(pre[pos+1]-pre[pos]));
    }
    if (nowres) now += p[x].first * nowres;
    //cout <<"debug:x:" <<x << "nowres:" << nowres << "now:"<<now<< "pos:"<<pos <<"\n";
    finans = max(finans,now);
}

signed main() {
    ios::sync_with_stdio(false);
    cin >>n >>m;
    for (int i = 1;i <= n;++i) {
        ll x,l,r;cin >> x >> l >> r;
        p[i] = mp(x,mp(l,r));
    } 
    sort(p+1,p+1+n);
    reverse(p+1,p+1+n);
    //从大到小
    res = m;
    for (int i = 1;i <= n;++i) {
        ans += (p[i].second.first) * p[i].first;
        res -= p[i].second.first;
        pre[i] = pre[i-1] + (p[i].second.second - p[i].second.first);
        val[i] = val[i-1] + (p[i].second.second - p[i].second.first) * p[i].first;
    } 
   // printf("pre:");for (int i = 1;i <= n;++i) cout <<pre[i] << " "; cout << "\n"; 
   // printf("val:");for (int i = 1;i <= n;++i) cout <<val[i] << " "; cout << "\n"; 
    finans = ans;
    for (int i = 1;i <= n;++i) {
        solve(i);
    }
    cout << finans;
}

/*
3 20
1 10 11
2 9 10
3 1 20
3 10
1 1 10
2 9 10
100000 0 10
*/