n people are standing on a coordinate axis in points with positive integer coordinates strictly less than 10⁶. For each person we know in which direction (left or right) he is facing, and his maximum speed.

You can put a bomb in some point with non-negative integer coordinate, and blow it up. At this moment all people will start running with their maximum speed in the direction they are facing. Also, two strange rays will start propagating from the bomb with speed s: one to the right, and one to the left. Of course, the speed s is strictly greater than people's maximum speed.

The rays are strange because if at any moment the position and the direction of movement of some ray and some person coincide, then the speed of the person immediately increases by the speed of the ray.

You need to place the bomb is such a point that the minimum time moment in which there is a person that has run through point 0, and there is a person that has run through point 10⁶, is as small as possible. In other words, find the minimum time moment t such that there is a point you can place the bomb to so that at time moment t some person has run through 0, and some person has run through point10⁶.

The first line contains two integers n and s (2 ≤ n ≤ 10⁵, 2 ≤ s ≤ 10⁶) — the number of people and the rays' speed.

The next n lines contain the description of people. The i-th of these lines contains three integers x_i, v_i and t_i (0 < x_i < 10⁶, 1 ≤ v_i < s,1 ≤ t_i ≤ 2) — the coordinate of the i-th person on the line, his maximum speed and the direction he will run to (1 is to the left, i.e. in the direction of coordinate decrease, 2 is to the right, i.e. in the direction of coordinate increase), respectively.

It is guaranteed that the points 0 and 10⁶ will be reached independently of the bomb's position.

Print the minimum time needed for both points 0 and 10⁶ to be reached.

Your answer is considered correct if its absolute or relative error doesn't exceed 10^- 6. Namely, if your answer is a, and the jury's answer is b, then your answer is accepted, if .

In the first example, it is optimal to place the bomb at a point with a coordinate of 400000. Then at time 0, the speed of the first person becomes 1000 and he reaches the point 10⁶ at the time 600. The bomb will not affect on the second person, and he will reach the 0point at the time 500000.

In the second example, it is optimal to place the bomb at the point 500000. The rays will catch up with both people at the time 200. At this time moment, the first is at the point with a coordinate of 300000, and the second is at the point with a coordinate of 700000. Their speed will become 1500 and at the time 400 they will simultaneously run through points 0 and 10⁶.

 /**

  * Codeforces

  * Problem#832C

  * Accepted

  * Time:155ms

  * Memory:7400k

  */

 #include <iostream>

 #include <cstdio>

 #include <ctime>

 #include <cmath>

 #include <cctype>

 #include <cstring>

 #include <cstdlib>

 #include <fstream>

 #include <sstream>

 #include <algorithm>

 #include <map>

 #include <set>

 #include <stack>

 #include <queue>

 #include <vector>

 #include <stack>

 #ifndef WIN32

 #define Auto "%lld"

 #else

 #define Auto "%I64d"

 #endif

 using namespace std;

 typedef bool boolean;

 const signed int inf = (signed)((1u << ) - );

 const signed long long llf = (signed long long)((1ull << ) - );

 const double eps = 1e-;

 const int binary_limit = ;

 #define smin(a, b) a = min(a, b)

 #define smax(a, b) a = max(a, b)

 #define max3(a, b, c) max(a, max(b, c))

 #define min3(a, b, c) min(a, min(b, c))

 template<typename T>

 inline boolean readInteger(T& u){

     char x;

     int aFlag = ;

     while(!isdigit((x = getchar())) && x != '-' && x != -);

     if(x == -) {

         ungetc(x, stdin);

         return false;

     }

     if(x == '-'){

         x = getchar();

         aFlag = -;

     }

     for(u = x - ''; isdigit((x = getchar())); u = (u << ) + (u << ) + x - '');

     ungetc(x, stdin);

     u *= aFlag;

     return true;

 }

 int opt = ;

 typedef class Segment {

     public:

         double l;

         double r;

         Segment(double l = 0.0, double r = 0.0):l(l), r(r) {        }

         Segment getBing(Segment b) {

             return Segment(max(l, b.l), min(r, b.r));

         }

         boolean hasint() {

             return (int)l != (int)r;

         }

         boolean isResonable() {

             return l <= r;

         }

         boolean operator < (Segment b) const {

             if(opt == ) {

                 if(l != b.l)    return l < b.l;

                 return r < b.r;

             }

             if(r != b.r)    return r < b.r;

             return l < b.l;

         }

 }Segment;

 boolean operator < (int x, Segment a) {

     if(opt == ) {

         return x < a.l;

     }

     return x < a.r;

 }

 int n, s;

 int pos[], spe[], ds[];

 inline void init() {

     readInteger(n);

     readInteger(s);

     for(int i = ; i <= n; i++) {

         readInteger(pos[i]);

         readInteger(spe[i]);

         readInteger(ds[i]);

     }

 }

 inline double calcS(double vs, double v0, double mid, double dist) {

     double t0 = (mid * (v0 + vs) - dist) / vs;

     return t0 * (vs - v0);

 }

 /*

 inline int ceil(double a) {

     if(a == (int)a)    return a;

     return (int)a + 1;

 }

 */

 inline boolean check(double mid) {

     double dist, t;

     boolean f1 = false, f2 = false;

     vector<Segment> v1, v2, v3;

     for(int i = ; i <= n && (!f1 || !f2); i++) {

         if(ds[i] ==  && !f1) {

             dist = pos[i];

             t = dist / spe[i];

             if(t > mid) {

                 double s1 = calcS(s, spe[i], mid, dist);

                 if(s1 < )    continue;

                 v1.push_back(Segment(pos[i], pos[i] + s1));

                 v2.push_back(Segment(pos[i], pos[i] + s1));

             } else    f1 = true;

         } else if(ds[i] ==  && !f2) {

             dist = 1e6 - pos[i];

             t = dist / spe[i];

             if(t > mid) {

                 double s1 = calcS(s, spe[i], mid, dist);

                 if(s1 < )    continue;

                 v3.push_back(Segment(pos[i] - s1, pos[i]));

             } else f2 = true;

         }

     }

     if(f1 && f2)    return true;

     if(f1 && !v3.empty())    return true;

     if(f2 && !v1.empty())    return true;

     opt = ;

     sort(v1.begin(), v1.end());

     opt = ;

     sort(v2.begin(), v2.end());

     int sv1 = (signed)v1.size();

     for(int i = , s; i < v3.size(); i++) {

         Segment b = v3[i];

         opt = ;

         s = sv1 - (upper_bound(v1.begin(), v1.end(), (int)v3[i].r) - v1.begin());

         opt = ;

         s += upper_bound(v2.begin(), v2.end(), (int)ceil(v3[i].l)) - v2.begin();

         if(s < sv1)

             return true;

     }

     return false;

 }

 inline void solve() {

     int cnt = ;

     double l = 0.0, r = 1e6;

     while(l + eps < r && cnt <= binary_limit) {

         double mid = (l + r) / ;

         cnt++;

         if(check(mid))    r = mid;

         else l = mid;

     }

     printf("%.9lf", r);

 }

 int main() {

     init();

     solve();

     return ;

 }