#include <bits/stdc++.h>
using namespace std;
//#define int long long
using LL = long long;
typedef pair<int,int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int inf = 2E9;
using vi = vector<int>;
using vp = vector<PII>;
#define all(x) begin(x), end(x) 
struct node{
	int w, l, r;
};
void solve() {
	int n;
	LL m;
	cin >> n >> m;
	vector<node> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i].w >> v[i].l >> v[i].r;
	}
	sort(all(v), [&](const struct node &x, const struct node &y) {
		return x.w > y.w;
	});
	LL ans = 0;
	for (int i = 0; i < n; i++) {
		auto [w, l, r] = v[i];
		if (m >= l) {
			if (m >= r) {
				ans += 1ll * w * r;
				m -= r;
			} else {
				ans += 1ll * m * w;
				m = 0;
			}
		} else {
			continue;
		}
		if (m == 0) break;
	}
	cout << ans << endl;
}

signed main() {
   ios::sync_with_stdio(false);
   cin.tie(nullptr);
   int t = 1;
   // cin >> t;
   while (t--) {
      solve();
   }
   return 0;
}