#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
using namespace std;
typedef long long ll;

bool overlap(int l1, int r1, int l2, int r2) {
	return r1 >= l2 && l1 <= r2;
}

int main() {
	int N, L;
	cin >> N >> L;
	vector<int> X(N), W(N), T(N);
	rep (i, N) cin >> X[i] >> W[i] >> T[i];
	int pos = 0;
	int k = 0;
	int ans = 0;
	while (k < N) {
		while (pos < X[k]) pos++, ans++;
		int period = 2 * T[k];
		int l = ans % period;
		int r = l + W[k];
		if (overlap(l, r - 1, T[k], 2 * T[k] - 1)) {
			ans = (ans + period - 1) / period * period;
			k++;
		} else {
			k++;
		}
	}
	while (pos < L) ans++, pos++;
	cout << ans << endl;
	return 0;
}