#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 1e5+3;
int n;ll m;
ll ans,sum[N],sumw[N];
struct node{
    int w,l,r;
    bool operator < (const node& a){
        return w>a.w;
    }
}a[N];



ll fastPow(ll a, ll n, ll mod){
    ll ans = 1;
    a %= mod;
    while(n) {
        if(n & 1)   ans = (ans*a) % mod;
        a = (a*a) % mod;
        n >>= 1;
    }
    return ans;
}

ll solve(int x){
    ll res = 0,tm = m+a[x].l;
    res -= a[x].w*a[x].l;
    int id = lower_bound(sum+1,sum+n+1,tm)-(sum+1);
    if(id<x){
        res+=sumw[id];
        tm-=sum[id];
        res+=a[id+1].w*tm;
    }
    else{
        res+=sumw[x-1];
        tm-=sum[x-1];
        res+=a[x].w*tm;
    }
    return res;
}

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;
    ans = 0;
    rep(i,1,n)cin>>a[i].w>>a[i].l>>a[i].r;
    sort(a+1,a+n+1);
    rep(i,1,n){
        sum[i] = sum[i-1]+(a[i].r-a[i].l);
        m-=a[i].l;
        sumw[i] = sumw[i-1]+1ll*a[i].w*(a[i].r-a[i].l);
        ans += a[i].w*a[i].l;
    }
    ll tmp = 0;
    rep(i,1,n){
        tmp = max(tmp,solve(i));
    }
    cout<<ans+tmp;
	return 0;
}