#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)

int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  int n,l;
  cin>>n>>l;
  vector<int> x(n);
  vector<int> w(n);
  vector<int> t(n);
  rep(i,n)
    cin>>x[i]>>w[i]>>t[i];
  x.push_back(l);

  int times = x[0];
  rep(i,n){
    if(times%(2*t[i])<t[i] && (times+w[i])%(2*t[i])<=t[i]){
      times+=w[i];
    }else{
      times += 2*t[i] - times % (2*t[i]);
      times += w[i];
    }
    times += x[i+1] - (x[i]+w[i]);
  }
  cout<<times<<endl;
  return 0;
}