#include <bits/stdc++.h>
using namespace std;
struct pi {
  double x, v, m;
} pp[101];
int vis[11][11];
double dis[101][101];
int main() {
  int i, j, n, p, q;
  double t;
  cin >> n >> t;
  for (i = 0; i < n; i++) {
    scanf("%lf%lf%lf", &pp[i].x, &pp[i].v, &pp[i].m);
  }
  double s = 0;
  p = -1;
  q = -1;
  while (s + 1e-8 <= t) {
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) {
        if (i == j) continue;
        dis[i][j] = 1000000000;
      }
    }
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) {
        if (i == j) continue;
        if (pp[i].x <= pp[j].x && !(vis[i][j] || vis[j][i])) {
          if (pp[i].v > 1e-8) {
            if (pp[j].v > 1e-8 && pp[i].v > pp[j].v + 1e-8) {
              dis[i][j] = (pp[j].x - pp[i].x) / (pp[i].v - pp[j].v);
            } else if (pp[j].v + 1e-8 < 0)
              dis[i][j] = (pp[j].x - pp[i].x) / (pp[i].v - pp[j].v);
          } else {
            if (pp[j].v < 0 && pp[i].v > pp[j].v + 1e-8) {
              dis[i][j] = (pp[j].x - pp[i].x) / (pp[i].v - pp[j].v);
            }
          }
          dis[j][i] = dis[i][j];
        }
      }
    }
    double ss = 1000000000;
    int x = 0, y = 0;
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) {
        if (i == j) continue;
        if (dis[i][j] + 1e-8 < ss) {
          ss = dis[i][j];
          x = i;
          y = j;
        }
      }
    }
    vis[x][y] = 1;
    if (s + ss >= t + 1e-8) {
      for (i = 0; i < n; i++) {
        pp[i].x = pp[i].x + (t - s) * pp[i].v;
      }
      break;
    } else {
      for (i = 0; i < n; i++) {
        pp[i].x = pp[i].x + ss * pp[i].v;
      }
      double v1, v2;
      if (ss != 0) memset(vis, 0, sizeof(vis));
      vis[x][y] = 1;
      v1 = pp[x].v;
      v2 = pp[y].v;
      pp[x].v = (pp[x].m - pp[y].m) * v1 + 2 * pp[y].m * v2;
      pp[x].v /= (pp[x].m + pp[y].m);
      pp[y].v = (pp[y].m - pp[x].m) * v2 + pp[x].m * 2 * v1;
      pp[y].v /= (pp[x].m + pp[y].m);
      s += ss;
    }
  }
  for (i = 0; i < n; i++) printf("%.6lf\n", pp[i].x);
}
