#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 1e5 + 100;

int b[N];
int l[N], r[N];

int n, x;

int get_val(int i, int x) {
    if (x >= b[i]) return l[i] * b[i] + r[i] * (x - b[i]);
    else return x * l[i];
}

int SUM;

bool check(int bound) {
    int cnt = bound / x;
    int rest = bound % x;

    vi a(n);
    fori (i, n) a[i] = i;
    sort(ALL(a), [&](int i, int j) -> bool {return get_val(i, x) < get_val(j, x);});
    reverse(ALL(a));
    ll sum = 0;
    fori (i, cnt + 1) sum += get_val(a[i], x);
    ll ans = 0;
    fori (i, cnt + 1) {
        int cur = sum - get_val(a[i], x) + get_val(a[i], rest);
        inmax(ans, cur);
    }
    sum -= get_val(a[cnt], x);
    for (int i = cnt + 1; i < n; ++i) {
        int cur = sum + get_val(a[i], rest);
        inmax(ans, cur);
    }
    return ans >= SUM;
}

void smain() {

    cin >> n >> x;

    fori (i, n) {
        cin >> b[i] >> l[i] >> r[i];
        SUM += l[i] * b[i];
    }
    int lf = -1, rf = n * x;
    while (rf - lf > 1) {
        int mid = lf + rf >> 1;
        (check(mid) ? rf : lf) = mid;
    }
    cout << rf;
}


Measured memory_bytes: 3456