#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

ll x[110], w[110], t[110];

int main() {
	ll n, l;
	cin >> n >> l;

	rep(i, 0, n)cin >> x[i] >> w[i] >> t[i];

	ll ans = 0;
	rep(i, 0, n) {
		if (i) {
			ans += x[i] - (x[i - 1] + w[i - 1]);
		}
		else {
			ans += x[i];
		}

		if ((ans / t[i]) % 2 != 0)ans += t[i] - (ans%t[i]) + w[i];
		else {
			if (t[i] - (ans%t[i]) >= w[i])ans += w[i];
			else ans += t[i] + t[i] - (ans%t[i]) + w[i];
		}
	}
	ans += l - (x[n - 1] + w[n - 1]);

	cout << ans << endl;
	return 0;
}