#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000003;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r,idx;
ll x[500005],y[500005],z[500005];
char s[500005],t[500005];
//bool used[500005];
bool flag,dame;
P table[500005];


int main(){
	cin >> n >> k;
    for(i=0;i<n;i++){
        cin >> x[i] >> y[i] >> z[i];
    }
    for(i=0;i<n;i++){
        ll buppa,sabo;
        buppa = z[i] * (k - x[i]);
        sabo = y[i] * x[i];
        table[i].first = buppa + sabo;
        sum -= sabo;
        table[i].second = i;
    }
    sort(table,table+n);
    reverse(table,table+n);
    for(i=0;i<n;i++){
        if(sum >= 0){
            p(ans);
            return 0;
        }
        if(sum + table[i].first < 0){
            ans += k;
            sum += table[i].first;
        }else{
            num = INF;

            ans += k;
            sum += table[i].first;
            a = 0;
            d = INF;

            for(j=0;j<n;j++){
                //if(j > i)break;

                if(j <= i){
                    //いままでに見た奴を捨てる
                    sum -= table[j].first;
                    idx = table[j].second;
                    ans -= k;
                }

                idx = table[j].second;
                if(sum + y[idx] * x[idx] + (k-x[idx]) * z[idx] < 0){
                    continue;
                }else if(sum + y[idx] * x[idx] >= 0){
                    sum *= -1;
                    d = min(d,ans + (sum + y[idx] - 1) / y[idx]);
                    sum *= -1;
                }else{
                    sum += y[idx] * x[idx];
                    b = x[idx];
                    sum *= -1;
                    d = min(d,ans + b + ((sum + z[idx] - 1) / z[idx]));
                    sum *= -1;
                    sum -= y[idx] * x[idx];
                }
                if(j < i){
                    //いままでに見た奴を捨てる
                    sum += table[j].first;
                    ans += k;
                }
            }
            p(d);
            return 0;
        }   
    }


	return 0;
}

Measured memory_bytes: 19712