#include <bits/stdc++.h>
using namespace std;
const int maxn = 101;
int N, L;
int X[maxn], W[maxn], T[maxn];
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> N >> L;
    for (int i = 0; i < N; i++) {
        cin >> X[i] >> W[i] >> T[i];
    }
    int cur = 0;

    long time = 0;
    for (int i = 0; i < N; i++) {
        long elapsed = X[i] - cur;
        time += elapsed;
        long q = time / T[i];
        if (q % 2 == 1) {
            time = (time + T[i] - 1) / T[i] * T[i];
            time += W[i];
            cur = X[i] + W[i];
        } else {
            long r = (time + W[i]) / T[i];
            if (q != r) {
                time = (time + T[i] - 1) / T[i] * T[i];
                time += T[i];
            }
            time += W[i];
            cur = X[i] + W[i];
        }
    }
    time += L - cur;
    cout << time << "\n";
}