#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, n, l, t, pos, ans;
    cin >> n >> l;
    ans = pos = 0;
    rep (i,n) {
        int x, w, t;
        cin >> x >> w >> t;
        ans += x - pos;
        if (ans/t%2 == 1 || ans < ans/t*t || (ans/t+1)*t < ans+w)
            ans = (ans/t+2-ans/t%2) * t;
        ans += w;
        pos = x + w;
    }
    ans += l - pos;
    cout << ans << endl;
    return 0;
}