#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
using namespace std;

int X[110];
int W[110];
int T[110];
int main(){
	int N,L;
	cin>>N>>L;
	REP(i,0,N)	cin>>X[i]>>W[i]>>T[i];
	X[N]=L;
	int now=X[0];
	REP(i,0,N){
		if(now%(2*T[i])>T[i]-W[i])
			now+=2*T[i]-(now%(2*T[i]));
		now+=X[i+1]-X[i];
	}
	p(now);
}