//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>

namespace n91 {

void main_() {
  usize n;
  u64 x;
  std::cin >> n >> x;
  std::vector<u64> b(n), l(n), u(n);
  u64 base = static_cast<u64>(0);
  for (const auto i : rep(0, n)) {
    std::cin >> b[i] >> l[i] >> u[i];
    base += l[i] * b[i];
  }

  const auto cost = [&](const usize i, const u64 p) {
    if (p <= b[i]) {
      return l[i] * p;
    } else {
      return l[i] * b[i] + u[i] * (p - b[i]);
    }
  };

  std::vector<u64> lim(n);

  for (const auto i : rep(0, n)) {
    lim[i] = cost(i, x);
  }
  std::vector<usize> idx(n);
  std::iota(idx.begin(), idx.end(), static_cast<usize>(0));
  std::sort(idx.begin(), idx.end(),
            [&lim](const usize l, const usize r) { return lim[l] > lim[r]; });

  const auto is_ok = [&](u64 s) {
    u64 ret = static_cast<u64>(0);
    u64 temp = static_cast<u64>(0);
    usize q = static_cast<usize>(0);
    while (s >= x) {
      temp += lim[idx[q]];
      s -= x;
      ++q;
    }
    for (const auto i : rep(0, q)) {
      ret = std::max(ret, temp - lim[idx[i]] + cost(idx[i], s) + lim[idx[q]]);
    }
    for (const auto i : rep(q, n)) {
      ret = std::max(ret, temp + cost(idx[i], s));
    }
    return ret >= base;
  };

  u64 left = 0, right = x * static_cast<u64>(n);
  while (left != right) {
    const u64 mid = (left + right) / static_cast<u64>(2);
    if (is_ok(mid)) {
      right = mid;
    } else {
      left = mid + static_cast<u64>(1);
    }
  }
  std::cout << right << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 4224