#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:836777216")
using namespace std;
int n, t;
double x[11], v[11], m[11];
int main() {
  cin >> n >> t;
  for (int i(0); i < (n); i++) cin >> x[i] >> v[i] >> m[i];
  double curr = 0;
  while (curr < t) {
    double next = 1e100;
    for (int i(0); i < (n); i++)
      for (int j(0); j < (n); j++)
        if (i != j) {
          double d = x[j] - x[i];
          double vv = -(v[j] - v[i]);
          if (fabs(d) > 1e-9) {
            double tt = d / vv;
            if (tt > 0 && next > tt) next = tt;
          }
        }
    bool h = 1;
    if (curr + next > t) next = t - curr, h = 0;
    for (int i(0); i < (n); i++) x[i] += v[i] * next;
    curr += next;
    if (h) {
      for (int i(0); i < (n); i++)
        for (int j(0); j < (n); j++)
          if (i < j && fabs(x[i] - x[j]) < 1e-9) {
            int p1 = i;
            int p2 = j;
            double v1 = v[p1];
            double v2 = v[p2];
            v[p1] = ((m[p1] - m[p2]) * v1 + 2 * m[p2] * v2) / (m[p1] + m[p2]);
            v[p2] = ((m[p2] - m[p1]) * v2 + 2 * m[p1] * v1) / (m[p1] + m[p2]);
          }
    } else
      break;
  }
  for (int i(0); i < (n); i++) printf("%.10lf\n", x[i]);
  return 0;
}
