#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, L;

    cin >> N >> L;
    
    vector<int> X(N);
    vector<int> W(N);
    vector<int> T(N);
    for (int i = 0; i < N; i++) {
        cin >> X[i] >> W[i] >> T[i];
    }

    int x = 0;
    int t = 0;
    for (int i = 0; i < N; i++) {
        t += X[i] - x;
        x = X[i];

        if ((t % (2 * T[i])) >= T[i] || ((t + W[i] - 1) % (2 * T[i]) >= T[i])) {
            t = (t + 2 * T[i] - 1) / (2 * T[i]) * (2 * T[i]);
        }
        t += W[i];
        x += W[i];
    }
    t += (L - x);

    cout << t << endl;
    return 0;
}