#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
typedef pair<int,int> pii;

const int N=3e5+10;

struct node{
    int w,l,r;
}a[N];

map<int,int> mp;
int sum[N];
int ss[N];

void solve(){
    int n,m;
    cin>>n>>m;
    int now=0;
    int nw=0;
    for(int i=1;i<=n;i++) {
        cin>>a[i].w>>a[i].l>>a[i].r;
        now+=a[i].l;
        nw+=a[i].l*a[i].w;
    }
    sort(a+1,a+1+n,[&](node a,node b){
        return a.w>b.w;
    });
    for(int i=1;i<=n;i++){
        sum[i]=sum[i-1]+a[i].r-a[i].l;
        ss[i]=ss[i-1]+(a[i].r-a[i].l)*a[i].w;
    }
    sort(sum+1,sum+1+n);
    int ans=nw;
    for(int i=1;i<=n;i++){
        int pos=upper_bound(sum+1,sum+1+i,a[i].l+m-now)-sum;
        ans=max(ans,nw+ss[pos-1]-(a[i].l)*a[i].w+a[i].w*(m-now+a[i].l-sum[pos-1]));
        // cout<<m<<" "<<now<<" "<<sum[pos-1]<<"\n";
    }
    cout<<ans<<"\n";
}
signed main(){
    IOS
    int T=1;
    // cin>>T;
    while(T--){
        solve();
    }
}