#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#define int long long
// #define int __int128
#define re read()
#define pr(x) print(x)
#define fup(a, b, c, d) for(int a = (b); a <= (c); a += (d))
#define fdo(a, b, c, d) for(int a = (b); a >= (c); a -= (d))
typedef long long ll;
typedef pair<int , int> PII;
typedef map<int , int> MII;
const int inf = 0x3f3f3f3f, N = 2e6 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, m;

struct node
{
	int w, l, r, cnt;
};

node op[N];
vector<PII> ve, vve;
vector<PII> vsu;

bool cmp(PII a, PII b)
{
	return a > b;
}

void solve()
{
	cin >> n >> m;

	int su = 0, cnt = 0, mma = 0;

	fup(i, 1, n, 1) {
		int w, l, r;
		cin >> w >> l >> r;
		op[i] = {w, l, r, r - l};
		ve.push_back({w, l});
		su += w * l;
		cnt += l;
		if(r - l) vve.push_back({w, r - l});
	}
	// cout << su << '\n';
	// cout << cnt << '\n';

	sort(ve.begin(), ve.end());
	sort(vve.begin(), vve.end());

	
	mma = su + ve.back().first * (m - cnt);


	int opnu = m - cnt, opsu = 0, f = 0;

	fdo(i, vve.size() - 1, 0, 1) {
		if(opsu + vve[i].second > opnu) {
			vve[i].second -= (opnu - opsu);
			su += (opnu - opsu) * vve[i].first;
			break ;
		}
		opsu += vve[i].second;
		su += vve[i].second * vve[i].first;
		f ++;
	}
	// cout << su << '\n';

	while(f --) {
		vve.pop_back();
	}

	sort(vve.begin(), vve.end(), cmp);

	
	int ssu = 0, cn = 0;

	fup(i, 0, vve.size() - 1, 1) {
		int w = vve[i].first, op = vve[i].second;
		ssu += w * op;
		cn += op;
		vsu.push_back({cn, ssu});
	}
	// cout << su << '\n';

	// for(auto x : ve) {
	// 	cout << x.first << ' ' << x.second << '\n';
	// }
	// cout << '\n';

	// for(auto x : vsu) {
	// 	cout << x.first << ' ' << x.second << '\n';
	// }
	// cout << '\n';

	fup(i, 0, n - 1, 1) {
		int w = ve[i].first, op = ve[i].second, summ;
		// cout << w << ' ' << op << " : ";
		PII x = {op, 0};
		auto it = lower_bound(vsu.begin(), vsu.end(), x) - vsu.begin();
		// cout << it << '\n';
		if(op == vsu[it].first) {
			summ = (vsu[it].second - w * op);
			// cout << w << ' ' << op << ' ' << vsu[i].second << '\n';
			mma = max(su + summ, mma);
		}
		else if(!it) {
			summ = vve[it].first * op - w * op;
			mma = max(su + summ, mma);
		}
		else {
			summ = vsu[it - 1].second + vve[it].first * (op - vsu[it - 1].first) - w * op;
			mma = max(su + summ, mma);
		}
		// cout << su + summ << '\n';
	}
	// cout << '\n';
	cout << mma << '\n';
}

signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);

    int _ = 1;
    // cin >> _;
    while(_ --)
    {
        solve();
    }
}