#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N, L;
int X[100], W[100], T[100];

int main(int argc, char **argv) {
	cin >> N >> L;
	REP(i, N) cin >> X[i] >> W[i] >> T[i];
	int x = 0, t = 0;
	REP(i, N) {
		t += X[i] - x;
		x = X[i] + W[i];
		int t2 = t + W[i] - 1;
		bool s1 = (t / T[i] % 2 == 0), s2 = (t2 / T[i] % 2 == 0);
		if (s1 && s2) t += W[i];
		else if (s2) t = t2 / T[i] * T[i] + W[i];
		else t = (t2 / T[i] + 1) * T[i] + W[i];
		cerr << t << endl;
	}
	cout << (t + L - x) << endl;
	return 0;
}