#include <bits/stdc++.h>

using namespace std;

int main() {
  int n, l;
  cin >> n >> l;
  vector<int> x(n), w(n), t(n);
  for (int i = 0; i < n; ++i) cin >> x[i] >> w[i] >> t[i];
  int p = 0, k = 0;
  for (int i = 0; i < n; ++i) {
    k += x[i] - p;
    if ((k + w[i]) % (2 * t[i]) > t[i]) k += 2 * t[i] - k % (2 * t[i]);
    k += w[i];
    p = x[i] + w[i];
  }
  k += l - x.back() - w.back();
  cout << k << endl;
}