#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef multiset<int>::iterator msi;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x).end()
#define sq(x) ((x)*(x))
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
template<class T> void chmin(T& a,const T& b){if(a>b)a=b;}
template<class T> void chmax(T& a,const T& b){if(a<b)a=b;}
int N,L;
int X[105],W[105],T[105];
bool check(int id,int time){
	if((time/T[id])%2==0)return true;
	else return false; 
}
int rest(int id,int time){
	return T[id]-(time%T[id]);
}
int main(){
	scanf("%d %d",&N,&L);
	for(int i=0;i<N;i++){
		scanf("%d %d %d",&X[i],&W[i],&T[i]);	
	}
	int pos = 0;
	int t = 0;
	for(int i=0;i<N;i++){
		t += X[i]-pos;
		pos = X[i];
		if(check(i,t)){
			if(check(i,t+W[i])){
				pos += W[i];
				t += W[i];
			}else{
				t += rest(i,t)+T[i];
				pos += W[i];
				t += W[i];
			}
		}else{
			t += rest(i,t);
			pos += W[i];
			t += W[i];
		}
	}
	t += L-pos;
	printf("%d\n",t);
	return 0;
}