#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  vector<array<int, 3>> v;
  int64_t n, m; cin >> n >> m;
  int64_t sl = 0, wl = 0;
  for (int i = 0; i < n; ++i) {
    int w, l, r; cin >> w >> l >> r;
    v.push_back({w, l, r - l});
    sl += l, wl += w * l;
  }
  sort(v.begin(), v.end());
  int64_t ans = wl + int64_t(m - sl) * v.back()[0];
  int64_t i = n, s = sl - m, ws = 0, pk = -1;
  for (int k = 0; k < n; ++k) {
    if (pk != -1 && v[pk][1] >= v[k][1]) continue;
    pk = k;
    while (i && s + v[i - 1][2] <= v[k][1] && v[i - 1][0] > v[k][0]) s += v[--i][2], ws += v[i][0] * int64_t(v[i][2]);
    ans = max(ans, wl - max(s, {}) * int64_t(v[k][0]) + ws);
    if (i && v[i - 1][0] > v[k][0]) {
      ans = max(ans, wl - v[k][1] * int64_t(v[k][0]) + ws + v[i - 1][0] * int64_t(v[k][1] - max(s, {})));
    }
  }
  cout << ans;
}