#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e6 + 3;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }

lint N, X;
vector<lint> full, zero, highest_sum;
lint zero_sum = 0;

lint prefix_highest(lint r, lint now){ // [0, r)
    lint ret = highest_sum[r] + zero_sum;
    if(now < r){
        return ret - full[now];
    }else{
        return ret - zero[now];
    }
}

int main(){
    cin >> N >> X;
    lint b_in[N], l_in[N], u_in[N];
    for(int i = 0; i < N; i++){
        cin >> b_in[i] >> l_in[i] >> u_in[i];
    }
    pair<lint, int> highest[N];
    for(int i = 0; i < N; i++){
        highest[i] = {u_in[i] * (X - b_in[i]) + l_in[i] * b_in[i], i};
    }
    sort(highest, highest + N, greater<>());
    full.resize(N), zero.resize(N);
    lint b[N], l[N], u[N];
    for(int i = 0; i < N; i++){
        int x = highest[i].second;
        b[i] = b_in[x];
        l[i] = l_in[x];
        u[i] = u_in[x];
        full[i] = u[i] * (X - b[i]);
        zero[i] = -l[i] * b[i];
        zero_sum += zero[i];
    }
    highest_sum.resize(N + 1, 0);
    for(int i = 0; i < N; i++){
        highest_sum[i + 1] = highest_sum[i] + full[i] - zero[i];
    }
    lint ans = 1e18;
    for(int i = 0; i < N; i++){
        lint low = -1, high = N; // (low, high]
        while(low + 1 < high){
            lint mid = (low + high) / 2;
            if(prefix_highest(mid, i) + full[i] >= 0){
                high = mid;
            }else{
                low = mid;
            }
        }
        lint this_ans = high * X;
        if(i < high){
            this_ans -= X;
        }
        lint score = -prefix_highest(high, i);
        if(score >= 0){
            this_ans += (score + u[i] - 1) / u[i] + b[i];
        }else{
            this_ans += max(0ll, b[i] - (-score) / l[i]);
        }
        ans = min(ans, this_ans);
    }
    cout << ans << endl;
}


Measured memory_bytes: 8860