Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Okabe and El Psy Kongroo

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOkabe likes to take walks but knows that spies from the Organization could be anywhere; that's why he wants to know how many different walks he can take in his city safely. Okabe's city can be represented as all points (*x*, *y*) such that *x* and *y* are non-negative. Okabe starts at the origin (point (0, 0)), and needs to reach the point (*k*, 0). If Okabe is currently at the point (*x*, *y*), in one step he can go to (*x* + 1, *y* + 1), (*x* + 1, *y*), or (*x* + 1, *y* - 1).

Additionally, there are *n* horizontal line segments, the *i*-th of which goes from *x* = *a*_{i} to *x* = *b*_{i} inclusive, and is at *y* = *c*_{i}. It is guaranteed that *a*_{1} = 0, *a*_{n} ≤ *k* ≤ *b*_{n}, and *a*_{i} = *b*_{i - 1} for 2 ≤ *i* ≤ *n*. The *i*-th line segment forces Okabe to walk with *y*-value in the range 0 ≤ *y* ≤ *c*_{i} when his *x* value satisfies *a*_{i} ≤ *x* ≤ *b*_{i}, or else he might be spied on. This also means he is required to be under two line segments when one segment ends and another begins.

Okabe now wants to know how many walks there are from the origin to the point (*k*, 0) satisfying these conditions, modulo 10^{9} + 7.

Input

The first line of input contains the integers *n* and *k* (1 ≤ *n* ≤ 100, 1 ≤ *k* ≤ 10^{18}) — the number of segments and the destination *x* coordinate.

The next *n* lines contain three space-separated integers *a*_{i}, *b*_{i}, and *c*_{i} (0 ≤ *a*_{i} < *b*_{i} ≤ 10^{18}, 0 ≤ *c*_{i} ≤ 15) — the left and right ends of a segment, and its *y* coordinate.

It is guaranteed that *a*_{1} = 0, *a*_{n} ≤ *k* ≤ *b*_{n}, and *a*_{i} = *b*_{i - 1} for 2 ≤ *i* ≤ *n*.

Output

Print the number of walks satisfying the conditions, modulo 1000000007 (10^{9} + 7).

Examples

Input

1 3

0 3 3

Output

4

Input

2 6

0 3 0

3 10 2

Output

4

Note

The graph above corresponds to sample 1. The possible walks are:

The graph above corresponds to sample 2. There is only one walk for Okabe to reach (3, 0). After this, the possible walks are:

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/06/2022 07:11:30 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|