#include "bits/stdc++.h" #define REP(i,n,N) for(ll i=(n); i<(N); i++) #define RREP(i,n,N) for(ll i=(N-1); i>=n; i--) #define CK(n,a,b) ((a)<=(n)&&(n)<(b)) #define ALL(v) (v).begin(),(v).end() #define p(s) cout<<(s)<> typedef long long ll; using namespace std; const ll mod = 1e9+7; int main() { ll N, L; ll X[110],W[110],T[110]; cin>>N>>L; REP(i,0,N){ cin>>X[i]>>W[i]>>T[i]; } X[N] = L; ll ans =X[0]; REP(i,0,N){ if(ans % (2 * T[i]) > T[i] - W[i]){ ans += 2 * T[i] - (ans % (2 * T[i])); } ans += X[i+1] - X[i]; } p(ans); return 0; }