/*Time:2024-11-13 16:49:25*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define second se
#define first fi
#define vi vector<int>
#define vvi vector<vi>
#define all(v) v.begin(),v.end()
const int MOD = (int) 1e9 + 7;
const int INF = INT_MAX;
const int MAXN = 1e5+5;

struct node{
	int w,l,r;
	const bool operator<(const node& b){
		return w>b.w;
	}
}a[MAXN];

void solve() {
	int n,m;
	cin >> n >> m;
	for(int i = 0;i<n;i++){
		cin >> a[i].w >> a[i].l >> a[i].r;
	}
	int c1 = 0,c2=0;
	sort(a,a+n);
	int mm = m;

	node tmp1={a[0].w,a[0].l,a[0].r};

	a[0].l=0;
	a[0].r=INF;

	for(int i = 0;i<n;i++){
		c1+=a[i].l * a[i].w;
		mm-=a[i].l;
	}
	for(int i =0;i<n;i++){
		int t = min(mm,a[i].r - a[i].l);
		mm -= t;
		c1 += a[i].w * t;
	}

	a[0] = tmp1;
	a[n-1].l=0;
	a[n-1].r=INF;
	mm = m;
	for(int i = 0;i<n;i++){
		c2+=a[i].l * a[i].w;
		mm-=a[i].l;
	}
	for(int i =0;i<n;i++){
		int t = min(mm,a[i].r - a[i].l);
		mm -= t;
		c2 += a[i].w * t;
	}

	cout << max(c1,c2) << endl;
}

int32_t main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int T = 1;
    // cin >> T;
    while (T--)solve();
}