#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename T >
struct PrioritySumStructure {
  static const bool INCREASE = false;
  static const bool DECREASE = true;

  bool order;
  int k, sz;
  T sum;
  multiset< T > add, pend;

  PrioritySumStructure(int k, bool order = INCREASE) : k(k), sum(0), sz(0), order(order) {}

  void sweep() {
    while(sz < k && !pend.empty()) {
      auto p = order ? --pend.end() : pend.begin();
      sum += *p;
      ++sz;
      add.emplace(*p);
      pend.erase(p);
    }
    while(sz > k) {
      auto p = order ? add.begin() : --add.end();
      sum -= *p;
      --sz;
      pend.emplace(*p);
      add.erase(p);
    }
  }

  T get_sum() {
    if(sz < k) throw ("Get Sum Exception");
    return sum;
  }

  void add_element(T x) {
    ++sz;
    add.emplace(x);
    sum += x;
    sweep();
  }

  void delete_element(T x) {
    auto it = pend.find(x);
    if(it != pend.end()) {
      pend.erase(it);
    } else {
      --sz;
      sum -= x;
      add.erase(add.find(x));
      sweep();
    }
  }

  void increment_size() {
    ++k;
    sweep();
  }

  void decrement_size() {
    if(k == 0) throw ("Decrement Size Exception");
    --k;
    sweep();
  }
};


int main() {
  int N, X;
  cin >> N >> X;
  int64 loss = 0;
  vector< int64 > A(N), B(N), C(N);
  vector< int > ord;
  for(int i = 0; i < N; i++) {
    cin >> A[i] >> B[i] >> C[i];
    loss += B[i] * A[i];
    ord.emplace_back(i);
  }
  sort(begin(ord), end(ord), [&](int a, int b) {
    return B[a] > B[b];
  });

  auto get_cost = [&](int idx, int64 sum) {
    int64 add = 0;
    add += B[idx] * min(sum, A[idx]);
    add += C[idx] * max(0LL, sum - A[idx]);
    return add;
  };
  PrioritySumStructure< int64 > tap(1, true);
  for(int i = 0; i < N; i++) {
    tap.add_element(get_cost(i, X));
  }
  auto check = [&](int64 sum) {
    int64 need = sum / X;
    while(need > tap.k) tap.increment_size();
    while(need < tap.k) tap.decrement_size();
    for(int i : ord) {
      tap.delete_element(get_cost(i, X));
      bool f = tap.get_sum() + get_cost(i, sum % X) >= loss;
      tap.add_element(get_cost(i, X));
      if(f) return true;
    }
    return false;
  };
  int64 ok = 1LL * N * X, ng = -1;
  while(ok - ng > 1) {
    auto mid = (ok + ng) / 2;
    if(check(mid)) ok = mid;
    else ng = mid;
  }
  cout << ok << endl;
}

Measured memory_bytes: 7672