#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#define prl puts("\n------------------\n")
#define prln(x) (cout << #x << ' ' << x << endl)
#define pr(x) (cout << #x << ' ' << x << ' ' )
#define prv(x) (cout << x << ' ')
#else
#define prl 
#define prln(x) 
#define pr(x)
#define prv(x)
#endif
#define clr(x) memset((x), 0, sizeof((x)))
#define clr1(x) memset((x), -1, sizeof((x)))
#define endl "\n"
#define pi acos(-1)
#define rep(i, st, ed) for (int i = (st); i <= (ed); ++i)
#define rep0(i, st, ed) for (int i = (st); i < (ed); ++i)
#define per(i, st, ed) for (int i = (st); i >= ed; --i)
template<class T> void _sf(T &x) {cin >> x;}
void _sf(int &x) {scanf("%d", &x);}
void _sf(ll &x) {scanf("%lld", &x);}
void _sf(double &x) {scanf("%lf", &x);}
void _sf(char &x) {scanf(" %c", &x);}
void _sf(char *x) {scanf("%s", x);}
void sf() {}
template <class T, class...U> void sf(T & head, U&... tail) { _sf(head); sf(tail...);}
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;

int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

struct point {
    int b, l, u;
    ll s;
    bool operator < (const point &rhs) const {
        return s > rhs.s;
    }
};


int main(){
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        #if __cplusplus >= 201103L
        auto start = steady_clock::now();
        #endif
    #endif
    int n = read(), m = read();
    vector<point> a(n);
    ll need = 0;
    rep0(i, 0, n) {
        cin >> a[i].b >> a[i].l >> a[i].u;
        need += 1LL * a[i].b * a[i].l;
        a[i].s = 1LL * a[i].l * a[i].b + 1LL * a[i].u * (m - a[i].b);
    }
    sort(a.begin(), a.end());
    auto check = [&](ll t) {
        int full = t / m, small = t % m;
        ll sum = 0;
        for (int i = 0; i <= full; ++i) {
            sum += a[i].s;
        }
        ll ans = 0;
        for (int i = 0; i < n; ++i) {
            ll single = a[i].b <= small ? 1LL * a[i].u * small - 1LL * (a[i].u - a[i].l) * a[i].b : 1LL * a[i].l * small;
            if (i <= full) {
                ans = max(ans, sum - a[i].s + single);
            }else {
                ans = max(ans, sum - a[full].s + single);
            }
        }
        return ans >= need;
    };

    ll l = 0, r = 1LL * n * m;
    while (l < r) {
        ll mid = (l + r) >> 1;
        if (check(mid)) {
            r = mid;
        }else {
            l = mid + 1;
        }
    }
    cout << r << endl;

    #ifdef LOCAL
        #if __cplusplus >= 201103L
        auto end = steady_clock::now();
        duration<double> time_span = duration_cast<duration<double>>(end - start);;
        printf("Total time: %.6fs\n", time_span.count());
        #endif
    #endif
    return 0;
}

Measured memory_bytes: 2560