#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
//typedef pair<int,int> P;

struct P {
  int x,w,t;
};

int main() {
  int n,l;
  cin >> n >> l;
  int ans=0,now=0;
  P a[n];
  rep(i,n) cin >> a[i].x >> a[i].w >> a[i].t;
  rep(i,n) {
    ans+=a[i].x-now;
    int tt=ans%(a[i].t*2);
    if(tt+a[i].w>a[i].t) ans+=a[i].t*2-tt;
    ans+=a[i].w;
    now=a[i].x+a[i].w;
  }
  ans+=l-now;
  cout << ans << endl;
  return 0;
}