#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int X;
struct Exam {
  int b, l, u;
  int Eval() const {
    return b * l + (X - b) * u;
  }
  bool operator<(Exam& oth) const {
    return Eval() > oth.Eval();
  }
};
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n;
  cin>>n>>X;
  vector<Exam> exams;
  int sumb = 0;
  int to_beat = 0;
  RE (i, n) {
    int b, l, u;
    cin>>b>>l>>u;
    sumb += b;
    to_beat += b * l;
    exams.PB({b, l, u});
  }
  if (sumb == 0) {
    cout<<"0\n";
    return 0;
  }
  sort(ALL(exams));
  Exam nic;
  exams.insert(exams.begin(), nic);
  
  // take one less
  //int kl = 0, kp = n - 1;
  int best = 1e18;
  int sufficient = 0;
  int acc = 0;
  VI pref_sum(n + 2);
  RE (i, n) {
    pref_sum[i] =  pref_sum[i - 1] + exams[i].Eval();
//     if (acc >= to_beat) {
//       sufficient = i + 1;
//       break;
//     }
  }
  RE (i, n) {
    //int max_here = exams[i].Eval();
    int kl = 0, kp = n;
    int faj;
    int faj_tim;
    while (kl <= kp) {
      int aktc = (kl + kp) / 2;
      int sc = pref_sum[aktc];
      int tim = aktc * X;
      if (i > aktc) {
        sc += exams[i].Eval();
        tim += X;
      }
      if (sc >= to_beat) {
        kp = aktc - 1;
        faj = sc;
        faj_tim = tim;
      } else {
        kl = aktc + 1;
      }
    }
    debug(i, faj, faj_tim);
    int can_drop = faj - to_beat;
    if (can_drop <= (X - exams[i].b) * exams[i].u) {
      mini(best, faj_tim - can_drop / exams[i].u);
    }
    faj -= exams[i].Eval();
    faj_tim -= X;
    int need = to_beat - faj;
    debug(can_drop, need);
    if (need >= 0) {
      mini(best, faj_tim + (need + exams[i].l - 1) / exams[i].l);
    }
  }
  cout<<best<<endl;
    
//   int can_drop = acc - to_beat;
//   REP (i, sufficient) {
//     mini(best, X * sufficient - can_drop / exams[i].u);
//   }
//   acc -= exams[sufficient - 1].Eval();
//   int need = to_beat - acc;
//   FOR (i, sufficient - 1, n - 1) {
//     mini(best, X * (sufficient - 1) + (need + exams[i].l - 1) / exams[i].l);
//   }
//   cout<<best<<endl;
//   while (kl <= kp) {
//     int aktc = (kl + kp) / 2;
//     int any = 0;
//     int my_score = 0;
//     REP (i, aktc) {
//       my_score += exams[i].Eval();
//     }
//     int rest = to_best - my_score;
//     if (rest < 
//     FOR (i, aktc, n - 1) {
//       
//     
//     
//     if (any) {
//       kp = aktc - 1;
//     } else {
//       kl = aktc + 1;
//     }
//   }
//   

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 4980