#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;
  vector<array<int64_t, 2>> s(n + 1);
  int64_t ans = -1, sl = 0, sw = 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;
    sw += w * int64_t(l);
  }
  sort(v.rbegin(), v.rend());
  for (int i = 0; i < n; ++i) s[i + 1] = {s[i][0] + v[i][2], s[i][1] + v[i][0] * int64_t(v[i][2])};
  for (int i = 0; i < n; ++i) {
    int64_t l = 0, r = v[i][1] + m - sl + 1, iii = i;
    auto eval = [&](int64_t c) {
      auto i = upper_bound(s.begin(), s.end(), array{c + 1, c * 0 - 1}) - s.begin() - 1;
      return sw + s[i][1] + v[i][0] * min(c - s[i][0], {v[i][2]}) + v[iii][0] * (m - sl - s[i][0] - min(c - s[i][0], {v[i][2]}));
    };
    while (r > l + 2) {
      int m1 = (2 * l + r) / 3, m2 = (l + 2 * r) / 3;
      eval(m1) < eval(m2)? l = m1: r = m2;
    }
    ans = max({ans, eval(l), eval(r - 1)});
  }
  cout << ans;
}