package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func check(p, x, w, t int) int {
	ret := 0
	st := p / t
	rest := t - p%t
	// out(p, x, w, t, st, rest)
	if st%2 == 1 { // wait
		ret += rest
		return ret
	}
	if rest < w {
		ret += rest + t
		return ret
	}
	return ret
}

func main() {
	sc.Split(bufio.ScanWords)
	N, L := getInt(), getInt()
	x := make([]int, N)
	w := make([]int, N)
	t := make([]int, N)
	for i := 0; i < N; i++ {
		x[i], w[i], t[i] = getInt(), getInt(), getInt()
	}
	past := 0
	pos := 0
	for i := 0; i < N; i++ {
		past += x[i] - pos
		past += check(past, x[i], w[i], t[i])
		pos = x[i]
	}
	past += L - pos
	out(past)
}