Problem: On a number line there are n balls. At time moment 0 for each ball the following data is known: its coordinate xi, speed vi (possibly, negative) and weight mi. The radius of the balls can be ignored.

The balls collide elastically, i.e. if two balls weighing m1 and m2 and with speeds v1 and v2 collide, their new speeds will be: 

<image>.

Your task is to find out, where each ball will be t seconds after.

Input

The first line contains two integers n and t (1 ≤ n ≤ 10, 0 ≤ t ≤ 100) — amount of balls and duration of the process. Then follow n lines, each containing three integers: xi, vi, mi (1 ≤ |vi|, mi ≤ 100, |xi| ≤ 100) — coordinate, speed and weight of the ball with index i at time moment 0.

It is guaranteed that no two balls have the same coordinate initially. Also each collision will be a collision of not more than two balls (that is, three or more balls never collide at the same point in all times from segment [0;t]).

Output

Output n numbers — coordinates of the balls t seconds after. Output the numbers accurate to at least 4 digits after the decimal point.

Examples

Input

2 9
3 4 5
0 7 8


Output

68.538461538
44.538461538


Input

3 10
1 2 3
4 -5 6
7 -8 9


Output

-93.666666667
-74.666666667
-15.666666667

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 12;
struct Info {
  double x;
  double v;
  double m;
  int index;
};
bool comp1(const Info& p, const Info& q) {
  if (fabs(p.x - q.x) > 1e-6) {
    return (p.x - q.x < 1e-6);
  }
  return p.v - q.v < 1e-6;
}
bool comp2(const Info& p, const Info& q) { return p.index < q.index; }
int s[maxn];
Info a[maxn];
int main() {
  int i;
  int n;
  int j;
  double t;
  scanf("%d%lf", &n, &t);
  for (i = 0; i < n; i++) {
    scanf("%lf%lf%lf", &a[i].x, &a[i].v, &a[i].m);
    a[i].index = i;
  }
  double c = 0;
  double Min = 100000000.0;
  sort(a, a + n, comp1);
  while (c <= t) {
    j = 0;
    Min = 10000000.0;
    for (i = 1; i < n; i++) {
      if (a[i].v >= 1e-6 && a[i - 1].v >= 1e-6 && a[i].v >= a[i - 1].v) {
        continue;
      }
      if (a[i - 1].v <= 1e-6 && a[i].v <= 1e-6 && a[i].v >= a[i - 1].v) {
        continue;
      }
      if (a[i].v >= 1e-6 && a[i - 1].v <= 1e-6) {
        continue;
      }
      if (a[i].v >= 1e-6 && a[i - 1].v >= 1e-6 && a[i].v < a[i - 1].v) {
        double cur = (a[i].x - a[i - 1].x) / (a[i - 1].v - a[i].v);
        if (Min > cur) {
          j = 0;
          s[j++] = i;
          Min = cur;
        } else {
          if (Min == cur) {
            Min = cur;
            s[j++] = i;
          }
        }
        continue;
      }
      if (a[i - 1].v <= 1e-6 && a[i].v <= 1e-6 && a[i - 1].v > a[i].v) {
        double cur = (a[i].x - a[i - 1].x) / (a[i - 1].v - a[i].v);
        if (Min > cur) {
          j = 0;
          s[j++] = i;
          Min = cur;
        } else {
          if (Min == cur) {
            Min = cur;
            s[j++] = i;
          }
        }
        continue;
      }
      if (a[i - 1].v > 1e-6 && a[i].v < 1e-6) {
        double cur = (a[i].x - a[i - 1].x) / (a[i - 1].v - a[i].v);
        if (Min > cur) {
          j = 0;
          s[j++] = i;
          Min = cur;
        } else {
          if (Min == cur) {
            Min = cur;
            s[j++] = i;
          }
        }
        continue;
      }
    }
    if (c + Min >= t) {
      Min = t - c;
      for (i = 0; i < n; i++) {
        a[i].x = a[i].x + a[i].v * Min;
      }
      break;
    }
    for (i = 0; i < n; i++) {
      a[i].x = a[i].x + a[i].v * Min;
    }
    for (int k = 0; k < j; k++) {
      double temp = a[s[k] - 1].v;
      a[s[k] - 1].v = ((a[s[k] - 1].m - a[s[k]].m) * a[s[k] - 1].v +
                       2 * a[s[k]].m * a[s[k]].v) /
                      (a[s[k] - 1].m + a[s[k]].m);
      a[s[k]].v =
          ((a[s[k]].m - a[s[k] - 1].m) * a[s[k]].v + 2 * a[s[k] - 1].m * temp) /
          (a[s[k] - 1].m + a[s[k]].m);
    }
    c += Min;
  }
  sort(a, a + n, comp2);
  for (i = 0; i < n; i++) {
    printf("%.9lf\n", a[i].x);
  }
  return 0;
}