#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	int n, l;

	cin >> n >> l;
	vector<int> x(n, 0), w(n, 0), t(n, 0);

	long now_t = 0;
	long now_x = 0;
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> w[i] >> t[i];

	}

	for (int i = 0; i < n; i++) {
		now_t += x[i] - now_x;
		now_x = x[i];

		if (now_t % (2 * t[i]) + w[i] > t[i]) {
			now_t += 2 * t[i] - now_t % (2 * t[i]);
		}
		now_t += w[i];
		now_x = x[i] + w[i];
	}
	now_t += l - now_x;

	cout << now_t << endl;
	return 0;
}