Problem: Emuskald was hired to design an artificial waterfall according to the latest trends in landscape architecture. A modern artificial waterfall consists of multiple horizontal panels affixed to a wide flat wall. The water flows down the top of the wall from panel to panel until it reaches the bottom of the wall.

The wall has height t and has n panels on the wall. Each panel is a horizontal segment at height hi which begins at li and ends at ri. The i-th panel connects the points (li, hi) and (ri, hi) of the plane. The top of the wall can be considered a panel connecting the points ( - 109, t) and (109, t). Similarly, the bottom of the wall can be considered a panel connecting the points ( - 109, 0) and (109, 0). No two panels share a common point.

Emuskald knows that for the waterfall to be aesthetically pleasing, it can flow from panel i to panel j (<image>) only if the following conditions hold: 

  1. max(li, lj) < min(ri, rj) (horizontal projections of the panels overlap); 
  2. hj < hi (panel j is below panel i); 
  3. there is no such panel k (hj < hk < hi) that the first two conditions hold for the pairs (i, k) and (k, j). 



Then the flow for <image> is equal to min(ri, rj) - max(li, lj), the length of their horizontal projection overlap.

Emuskald has decided that in his waterfall the water will flow in a single path from top to bottom. If water flows to a panel (except the bottom of the wall), the water will fall further to exactly one lower panel. The total amount of water flow in the waterfall is then defined as the minimum horizontal projection overlap between two consecutive panels in the path of the waterfall. Formally: 

  1. the waterfall consists of a single path of panels <image>; 
  2. the flow of the waterfall is the minimum flow in the path <image>. 



To make a truly great waterfall Emuskald must maximize this water flow, but there are too many panels and he is having a hard time planning his creation. Below is an example of a waterfall Emuskald wants:

<image>

Help Emuskald maintain his reputation and find the value of the maximum possible water flow.

Input

The first line of input contains two space-separated integers n and t (1 ≤ n ≤ 105, 2 ≤ t ≤ 109), the number of the panels excluding the top and the bottom panels, and the height of the wall. Each of the n following lines contain three space-separated integers hi, li and ri (0 < hi < t,  - 109 ≤ li < ri ≤ 109), the height, left and right ends of the i-th panel segment.

It is guaranteed that no two segments share a common point.

Output

Output a single integer — the maximum possible amount of water flow in the desired waterfall.

Examples

Input

5 6
4 1 6
3 2 7
5 9 11
3 10 15
1 13 16


Output

4


Input

6 5
4 2 8
3 1 2
2 2 3
2 6 12
1 0 7
1 8 11


Output

2

Note

The first test case corresponds to the picture.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100005;
struct Time {
  int val, id;
} tim[2 * maxN];
struct Wall {
  int h, L, r;
} w[maxN];
int n, t, tims, trees;
struct Tnode {
  int id;
  Tnode *son[2], *f;
} tree[maxN], *nul, *root;
struct Tedge {
  int v, next;
} edge[2 * maxN];
int edges, dad[maxN], nex[maxN];
int in[maxN], f[maxN];
bool vis[maxN];
void insertedge(int u, int v) {
  edges++;
  edge[edges].v = v;
  edge[edges].next = dad[u];
  in[v]++;
  dad[u] = edges;
}
Tnode *newnode(int id) {
  trees++;
  tree[trees].id = id;
  tree[trees].son[0] = tree[trees].son[1] = tree[trees].f = nul;
  return tree + trees;
}
void Readln() {
  scanf("%d%d\n", &n, &t);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d\n", &w[i].h, &w[i].L, &w[i].r);
    tim[++tims].val = w[i].L;
    tim[tims].id = tims;
    tim[++tims].val = w[i].r;
    tim[tims].id = tims;
  }
}
bool cmp(Time a, Time b) {
  return a.val < b.val || a.val == b.val && a.id % 2 < b.id % 2;
}
void rot(Tnode *u, int t) {
  Tnode *v = u->f;
  Tnode *w = v->f;
  if (w != nul) {
    if (w->son[0] == v) w->son[0] = u;
    if (w->son[1] == v) w->son[1] = u;
  }
  u->f = w;
  v->son[t ^ 1] = u->son[t];
  if (u->son[t] != nul) u->son[t]->f = v;
  u->son[t] = v;
  v->f = u;
}
void splay(Tnode *u, Tnode *fa) {
  while (u->f != fa && u->f != nul) {
    Tnode *v = u->f;
    Tnode *w = v->f;
    if (v->f == fa) {
      rot(u, v->son[0] == u);
      break;
    }
    bool p = (v->son[0] == u), q = (w->son[0] == v);
    if (p ^ q) {
      rot(u, p);
      rot(u, q);
    } else {
      rot(v, q);
      rot(u, p);
    }
  }
  if (fa == nul) root = u;
}
Tnode *findpred(int h) {
  Tnode *ret = nul, *now = root;
  while (now != nul) {
    if (w[now->id].h >= h) {
      ret = now;
      now = now->son[1];
    } else
      now = now->son[0];
  }
  return ret;
}
Tnode *findsucc(int h) {
  Tnode *ret = nul, *now = root;
  while (now != nul) {
    if (w[now->id].h <= h) {
      ret = now;
      now = now->son[0];
    } else
      now = now->son[1];
  }
  return ret;
}
void inserttree(int h, int id) {
  if (root == nul) {
    root = newnode(id);
    return;
  }
  Tnode *pre = findpred(h);
  Tnode *suc = findsucc(h);
  if (pre != nul) nex[pre->id] = id;
  if (suc != nul) nex[id] = suc->id;
  if (pre == nul) {
    splay(suc, nul);
    suc->son[0] = newnode(id);
    suc->son[0]->f = suc;
    return;
  }
  if (suc == nul) {
    splay(pre, nul);
    pre->son[1] = newnode(id);
    pre->son[1]->f = pre;
    return;
  }
  splay(pre, nul);
  splay(suc, pre);
  root->son[1]->son[0] = newnode(id);
  root->son[1]->son[0]->f = root->son[1];
}
void deletetree(int h, int id) {
  Tnode *pre = findpred(h + 1);
  Tnode *suc = findsucc(h - 1);
  if (pre != nul)
    if (nex[pre->id] == id) insertedge(pre->id, id);
  if (suc != nul)
    if (nex[id] == suc->id) insertedge(id, suc->id);
  if (pre == nul && suc == nul) {
    root = nul;
    return;
  }
  if (pre == nul) {
    splay(suc, nul);
    root->son[0] = nul;
    return;
  }
  if (suc == nul) {
    splay(pre, nul);
    root->son[1] = nul;
    return;
  }
  splay(pre, nul);
  splay(suc, pre);
  root->son[1]->son[0] = nul;
}
void dfs(int now) {
  vis[now] = true;
  for (int i = dad[now]; i != 0; i = edge[i].next) {
    if (!vis[edge[i].v]) dfs(edge[i].v);
    int a = now, b = edge[i].v;
    int tmp = min(w[a].r, w[b].r) - max(w[a].L, w[b].L);
    f[now] = max(f[now], min(tmp, f[b]));
  }
}
void Solve() {
  nul = newnode(0);
  root = nul;
  sort(tim + 1, tim + 1 + tims, cmp);
  for (int i = 1; i <= 2 * n; i++) {
    int now = (tim[i].id + 1) / 2;
    if (tim[i].id % 2 == 1)
      inserttree(w[now].h, now);
    else
      deletetree(w[now].h, now);
  }
  for (int i = 1; i <= n; i++)
    if (dad[i] == 0) {
      f[i] = w[i].r - w[i].L;
      vis[i] = true;
    }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (in[i] == 0) ans = max(ans, f[i]);
  printf("%d\n", ans);
}
int main() {
  Readln();
  Solve();
  return 0;
}