#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> 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<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

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

    ll n, x;
    cin >> n >> x;
    vector<ll> b(n), l(n), u(n);
    REP(i, n) cin >> b[i] >> l[i] >> u[i];

    vector<PII> vp(n);
    vector<ll> s(n), rank(n);
    REP(i, n) vp[i] = {b[i]*l[i] + (x-b[i])*u[i], i};
    sort(ALL(vp), greater<>());
    REP(i, n) s[i] = vp[i].first, rank[vp[i].second] = i;
    ll sumb = 0;
    REP(i, n) sumb += b[i]*l[i];

    // cout << "sumb=" << sumb << endl;

    auto check = [&](ll k) {
        ll q = k/x, r = k%x;
        if(q == n) return true;
        ll sum1 = 0;
        REP(i, q) sum1 += s[i];
        // cout << "q=" << q << " r=" << r << " sum1=" << sum1 << endl;
        ll ma = 0;
        REP(i, n) {
            ll score = 0;
            // i番目のテストはr時間
            if(r > b[i]) score += b[i]*l[i] + (r-b[i])*u[i];
            else score += r*l[i];
            // cout << "i=" << i << " rank=" << rank[i] << " " << score << " ";
            // i番目のテストを除いてs[j]が大きい方からq個
            if(rank[i] < q) score += sum1 - (b[i]*l[i] + (x-b[i])*u[i]) + s[q];
            else score += sum1;
            // cout << score << endl;
            chmax(ma, score);
        }
        // cout << "k=" << k << " ma=" << ma << endl;
        return ma >= sumb;
    };

    // cout << check(2186) << endl;

    ll lb=-1, ub=n*x;
    while(ub-lb>1) {
        ll mid = (lb+ub)/2;
        // cout << lb << " " << mid << " " << ub << endl;
        if(check(mid)) ub = mid;
        else lb = mid;
    }
    cout << ub << endl;

    return 0;
}


Measured memory_bytes: 5760