#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) {return mrand()%x;}
const ll mod=998244353;
// head

const int N=1e5+10;
ll n,m;
ll sa[N],w[N],t,aw;
array<ll,3> ty[N];

void solve() {
	cin>>n>>m;
	rep(i,1,n+1) {
		cin>>ty[i][0]>>ty[i][1]>>ty[i][2];
		ty[i][2]-=ty[i][1];
		t+=ty[i][1],aw+=ty[i][0]*ty[i][1];
	}
	sort(ty+1,ty+n+1,[&](array<ll,3> a,array<ll,3> b){
		return a[0]>b[0];
	});
	rep(i,1,n+1) {
		sa[i]=ty[i][2];
		w[i]=ty[i][2]*ty[i][0];
		sa[i]+=sa[i-1],w[i]+=w[i-1];
	}
	ll ans=0;
	rep(i,1,n+1) {
		ll tmp=m-t+ty[i][1];
		ll nw=aw-ty[i][1]*ty[i][0];
		auto it=lower_bound(sa+1,sa+n+1,tmp)-sa;
		if (it>i) {
			nw+=w[it-1],tmp-=sa[it-1];
			nw+=tmp*ty[i][0];
		} else {
			nw+=w[it-1],tmp-=sa[it-1];
			nw+=tmp*ty[it][0];
		}
		ans=max(ans,nw);
	}
	cout<<ans<<endl;
}

int tc;
signed main() {
	ios::sync_with_stdio(0);
	tc=1;
	while (tc--) solve();
}