#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int main(){
	int n,l;
	cin >> n >> l;
	vector<int> x(n);
	vector<int> w(n);
	vector<int> t(n);
	for(int i=0; i<n; i++){
		cin >> x[i] >> w[i] >> t[i];
	}

	x.push_back(l);

	int time_ = x[0];
	for(int i=0; i<n; i++){
		if( time_%(2*t[i]) < t[i] && (time_+w[i])%(2*t[i]) <= t[i] ){
			time_ += w[i];
		}else{
			time_ += 2*t[i] - time_%(2*t[i]);
			time_ += w[i];
		}
		time_ += x[i+1] - (x[i] + w[i]);
	}

	cout << time_ << endl;

	return 0;
}