#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

int main(){
 	cin.tie(0);
 	ios::sync_with_stdio(false);
 	int n;
 	long long m;
 	cin >> n >> m;
 	vector<int> w(n), l(n), r(n);
 	forn(i, n){
 		cin >> w[i] >> l[i] >> r[i];
 	}
 	long long ans = 0;
 	long long sl = 0;
 	forn(i, n) sl += l[i];
 	long long sl2 = 0;
 	forn(i, n) sl2 += l[i] * 1ll * w[i];
 	vector<long long> su(n + 1), su2(n + 1);
 	for (int i = n - 1; i >= 0; --i){
 		su[i] = su[i + 1] + (r[i] - l[i]);
 		su2[i] = su2[i + 1] + (r[i] - l[i]) * 1ll * w[i];
 	}
 	forn(i, n){
 		long long lft = m - sl + l[i];
 		ans = max(ans, sl2 - l[i] * 1ll * w[i] + lft * 1ll * w[i]);
 	}
 	forn(i, n){
 		int lf = 0, rg = n - 1;
 		int res = -1;
 		while (lf <= rg){
 			int mid = (lf + rg) / 2;
 			long long mx = su[mid] - (i <= mid ? r[i] - l[i] : 0);
 			mx += sl - l[i];
 			if (mx >= m){
 				res = mid;
 				rg = mid - 1;
 			}
 			else{
 				lf = mid + 1;
 			}
 		}
 		if (res == 0 && i == 0) res = -1;
 		assert(res != i);
 		if (res == -1){
 			long long rem = m - (sl + su[0] - r[i]);
 			ans = max(ans, (sl2 + su2[0] - r[i] * 1ll * w[i]) + rem * w[i]);
 		}
 		else{
 			long long cur = su2[res] - (i <= res ? (r[i] - l[i]) * 1ll * w[i] : 0ll);
 			cur += sl2 - l[i] * 1ll * w[i];
 			long long rem = su[res] - (i <= res ? r[i] - l[i] : 0);
 			rem += sl - l[i];
 			assert(rem >= m);
 			rem -= m;
 			ans = max(ans, cur - w[res] * 1ll * rem);
 		}
 	}
 	cout << ans << '\n';
}