Problem: Airports often use moving walkways to help you walking big distances faster. Each such walkway has some speed that effectively increases your speed. You can stand on such a walkway and let it move you, or you could also walk and then your effective speed is your walking speed plus walkway's speed.

Limak wants to get from point 0 to point L on a straight line. There are n disjoint walkways in between. The i-th walkway is described by two integers x_i and y_i and a real value s_i. The i-th walkway starts at x_i, ends at y_i and has speed s_i. 

Every walkway is located inside the segment [0, L] and no two walkways have positive intersection. However, they can touch by endpoints.

Limak needs to decide how to distribute his energy. For example, it might make more sense to stand somewhere (or to walk slowly) to then have a lot of energy to walk faster.

Limak's initial energy is 0 and it must never drop below that value. At any moment, he can walk with any speed v in the interval [0, 2] and it will cost him v energy per second, but he continuously recovers energy with speed of 1 energy per second. So, when he walks with speed v, his energy increases by (1-v). Note that negative value would mean losing energy.

In particular, he can walk with speed 1 and this won't change his energy at all, while walking with speed 0.77 effectively gives him 0.23 energy per second.

Limak can choose his speed arbitrarily (any real value in interval [0, 2]) at every moment of time (including the moments when he is located on non-integer positions). Everything is continuous (non-discrete).

What is the fastest time Limak can get from 0 to L?

Input

The first line contains integers n and L (1 ≤ n ≤ 200 000, 1 ≤ L ≤ 10^9), the number of walkways and the distance to walk.

Each of the next n lines contains integers x_i, y_i and real value s_i (0 ≤ x_i < y_i ≤ L, 0.1 ≤ s_i ≤ 10.0). The value s_i is given with at most 9 digits after decimal point.

It's guaranteed, that no two walkways have a positive intersection. The walkways are listed from left to right. That is, y_i ≤ x_{i + 1} for 1 ≤ i ≤ n - 1.

Output

Print one real value, the fastest possible time to reach L. Your answer will be considered correct if its absolute or relative error won't exceed 10^{-9}.

Examples

Input


1 5
0 2 2.0


Output


3.000000000000


Input


1 5
2 4 0.91


Output


3.808900523560


Input


3 1000
0 990 1.777777
995 996 1.123456789
996 1000 2.0


Output


361.568848429553

Note

The drawings show the first two examples. In the first one, there is a walkway from 0 to 2 with speed 2.0 and Limak wants to get to point 5. The second example has a walkway from 2 to 4 with speed 0.91.

<image>

In the first example, one of optimal strategies is as follows.

  * Get from 0 to 2 by standing still on the walkway. It moves you with speed 2 so it takes 1 second and you save up 1 energy. 
  * Get from 2 to 4 by walking with max speed 2 for next 1 second. It takes 1 second again and the energy drops to 0. 
  * Get from 4 to 5 by walking with speed 1. It takes 1 second and the energy stays constant at the value 0. 



The total time is 1 + 1 + 1 = 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while ((c < '0' || c > '9') && (c != '-')) c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * f;
}
const int N = 4e5 + 10;
int n, m, cnt;
struct node {
  int l, r, len, pos;
  double v;
} a[N];
double Add[N], Need[N], pre[N];
double t[N << 2], lazy[N << 2];
inline void push_up(int u) { t[u] = min(t[u << 1], t[u << 1 ^ 1]); }
inline void upd(int u, double x) { t[u] += x, lazy[u] += x; }
inline void push_down(int u) {
  if (lazy[u] != 0) upd(u << 1, lazy[u]), upd(u << 1 ^ 1, lazy[u]), lazy[u] = 0;
}
inline void Build(int u, int l, int r) {
  if (l == r) return t[u] = pre[l], void(0);
  int mid = l + r >> 1;
  Build(u << 1, l, mid), Build(u << 1 ^ 1, mid + 1, r);
  push_up(u);
}
inline void update(int u, int l, int r, int ql, int qr, double x) {
  if (l >= ql && r <= qr) return upd(u, x), void(0);
  int mid = l + r >> 1;
  push_down(u);
  if (ql <= mid) update(u << 1, l, mid, ql, qr, x);
  if (qr > mid) update(u << 1 ^ 1, mid + 1, r, ql, qr, x);
  push_up(u);
}
inline double Query(int u, int l, int r, int ql, int qr) {
  if (l >= ql && r <= qr) return t[u];
  int mid = l + r >> 1;
  push_down(u);
  if (qr <= mid)
    return Query(u << 1, l, mid, ql, qr);
  else if (ql > mid)
    return Query(u << 1 ^ 1, mid + 1, r, ql, qr);
  else
    return min(Query(u << 1, l, mid, ql, qr),
               Query(u << 1 ^ 1, mid + 1, r, ql, qr));
}
int main() {
  n = cnt = read(), m = read();
  for (register int i = (1); i <= (n); i++)
    a[i].l = read(), a[i].r = read(), scanf("%lf", &a[i].v),
    a[i].len = a[i].r - a[i].l;
  for (register int i = (1); i <= (n); i++)
    if (a[i].l != a[i - 1].r)
      a[++cnt] = (node){a[i - 1].r, a[i].l, a[i].l - a[i - 1].r, 0, 0};
  if (a[n].r != m) a[++cnt] = (node){a[n].r, m, m - a[n].r, 0, 0};
  sort(a + 1, a + 1 + cnt, [](node a, node b) { return a.l < b.l; });
  for (register int i = (1); i <= (cnt); i++) {
    if (a[i].v != 0) Add[i] = a[i].len / a[i].v;
    Need[i] = a[i].len / (a[i].v + 2);
    pre[i] = pre[i - 1] + Add[i], a[i].pos = i;
  }
  sort(a + 1, a + 1 + cnt, [](node a, node b) { return a.v < b.v; });
  Build(1, 1, cnt);
  double ans = 0;
  for (register int i = (1); i <= (cnt); i++) {
    double tmp =
        min(Query(1, 1, cnt, a[i].pos, cnt), Need[a[i].pos] + Add[a[i].pos]);
    ans += (a[i].len - tmp + Add[a[i].pos]) / (a[i].v + 1);
    update(1, 1, cnt, a[i].pos, cnt, -tmp);
  }
  printf("%0.12lf", ans);
}