#include<bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint=vector<int>;
using vvint=vector<vint>;
using pint=pair<int, int>;
using vpint=vector<pint>;
template<typename T> using priority_queue_rev=priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct Setup {
    static constexpr int PREC = 20;
    Setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

long long binarySearch(long long ok, long long ng, std::function<bool(long long)> check) {
    while (abs(ok - ng) > 1) {
        long long mid = (ok + ng) / 2;
        (check(mid) ? ok : ng) = mid;
    }
    return ok;
}

int N, X;
int b[110000], l[110000], u[110000];
signed main() {
    cin >> N >> X;
    rep(i, N) { cin >> b[i] >> l[i] >> u[i]; }
    struct Test {
        int win, lose, bimyo;
    };
    cout << binarySearch(N * X, -1, [&](int t) {
        vector<Test> tests(N);
        rep(i, N) {
            tests[i] = {u[i] * (X - b[i]), l[i] * (-b[i]),
                        ((t % X > b[i]) ? u[i] : l[i]) * (t % X - b[i])};
        }
        sort(all(tests), [&](Test a, Test b) { return a.win - a.lose > b.win - b.lose; });
        if (t % X == 0) {
            int cur = 0;
            for (int i = 0; i < t / X; i++) { cur += tests[i].win; }
            for (int i = t / X; i < N; i++) { cur += tests[i].lose; }
            return cur >= 0;
        }
        int cur = LLONG_MIN;
        int sum0 = 0;
        for (int i = 0; i < t / X; i++) { sum0 += tests[i].win; }
        for (int i = t / X; i < N; i++) { sum0 += tests[i].lose; }
        for (int i = t / X; i < N; i++) { chmax(cur, sum0 - tests[i].lose + tests[i].bimyo); }
        int sum1 = 0;
        for (int i = 0; i < t / X + 1; i++) { sum1 += tests[i].win; }
        for (int i = t / X + 1; i < N; i++) { sum1 += tests[i].lose; }
        for (int i = 0; i < t / X + 1; i++) { chmax(cur, sum1 - tests[i].win + tests[i].bimyo); }
        return cur >= 0;
    }) << endl;
}


Measured memory_bytes: 4992