CF821E：Okabe and El Psy Kongroo（dp & 矩阵）

E. Okabe and El Psy Kongroo

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Okabe 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 = ai to x = bi inclusive, and is at y = ci. It is guaranteed that a1 = 0, an ≤ k ≤ bn, and ai = bi - 1 for 2 ≤ i ≤ n. The i-th line segment forces Okabe to walk with y-value in the range 0 ≤ y ≤ ci when his xvalue satisfies ai ≤ x ≤ bi, 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 109 + 7.

Input

The first line of input contains the integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 1018) — the number of segments and the destination xcoordinate.

The next n lines contain three space-separated integers ai, bi, and ci (0 ≤ ai < bi ≤ 1018, 0 ≤ ci ≤ 15) — the left and right ends of a segment, and its y coordinate.

It is guaranteed that a1 = 0, an ≤ k ≤ bn, and ai = bi - 1 for 2 ≤ i ≤ n.

Output

Print the number of walks satisfying the conditions, modulo 1000000007 (109 + 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:

• 
• 
• 
• 

题意：0，0出发，只能向右，右上，右下，走，且不能超过限制高度，问到达k，0点的方案数。

思路：范围太大，用矩阵优化即可。

# include <iostream>
# include <cstring>
using namespace std;
typedef long long LL;
const LL mod = 1e9+7;
struct Mat{LL mat[18][18];};
LL l[103], r[103], h[103];
int len;
Mat operator *(Mat a, Mat b)
{
    Mat c;
    for(int i=0; i<=len; ++i)
    {
        for(int j=0; j<=len; ++j)
        {
            c.mat[i][j] = 0;
            for(int k=0; k<=len; ++k)
            {
                c.mat[i][j] += (a.mat[i][k] * b.mat[k][j])%mod;
                c.mat[i][j] %= mod;
            }
        }
    }
    return c;
}
Mat operator ^(Mat a, LL k)
{
    Mat c;
    for(int i=0; i<=len; ++i)
        for(int j=0; j<=len; ++j)
            c.mat[i][j] = i==j;
    for(;k;k>>=1)
    {
        if(k&1) c = c*a;
        a = a*a;
    }
    return c;
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    LL k;
    cin >> n >> k;
    for(int i=0; i<n; ++i)
        cin >> l[i] >> r[i] >> h[i], r[i] = min(r[i], k);
    Mat t, b, c;
    for(int i=0; i<16; ++i)
    {
        for(int j=0; j<16; ++j)
        {
            if((j>=0 && j<16) && (j==i-1 || j==i || j==i+1)) t.mat[i][j] = 1;
            else t.mat[i][j] = 0;
        }
    }
    memset(c.mat, 0, sizeof(c.mat));
    c.mat[0][0] = 1;
    for(LL i=0; i<n; ++i)
    {
        len = h[i];
        b = t^(r[i]-l[i]);
        for(int j=h[i]+1; j<16; ++j) c.mat[j][0] = 0;
        b = b*c;
        for(int j=0; j<=h[i]; ++j) c.mat[j][0] = b.mat[j][0];
    }
    cout << c.mat[0][0] << '\n';
    return 0;
}