#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define mp make_pair
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, VL, greater<ll>> PQG;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18 + 1;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};

string S;

ll N, X;
struct Data {
    ll b, l, u;
    Data() { cin >> b >> l >> u; }
    ll sum() { return b * l + (X - b) * u; }
};

signed main() {
    cin >> N >> X;
    vector<Data> datas(N);
    sort(datas.begin(), datas.end(),
         [](auto l, auto r) { return l.sum() > r.sum(); });
    VL psum(N + 1);
    REP(i, N) { psum[i + 1] = psum[i] + datas[i].sum(); }
    ll bsum = 0;
    FOREACH(d, datas) { bsum += d.b * d.l; }
    auto check = [&](ll k) {
        if(k == N * X) return psum.back() >= bsum;
        REP(n, N) {
            auto q = k / X;
            ll sum = psum[q];
            if(n < q) sum = sum - datas[n].sum() + datas[q].sum();
            auto r = k % X;
            auto &data = datas[n];
            if(r <= data.b) {
                sum += data.l * r;
            } else {
                sum += data.l * data.b + data.u * (r - data.b);
            }
            if(sum >= bsum) return true;
        }
        return false;
    };

    ll l = 0, r = N * X;
    ll ans = r;
    while(l <= r) {
        auto c = (l + r) / 2;
        if(check(c)) {
            r = c - 1;
            ans = c;
        } else {
            l = c + 1;
        }
    }
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 3328