#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int maxn = 111;
double x[maxn], v[maxn], m[maxn];
int main() {
  int n;
  double t;
  scanf("%d%lf", &n, &t);
  for (int i = 0; i < n; i++) scanf("%lf%lf%lf", &x[i], &v[i], &m[i]);
  while (t > 0) {
    double mint = t;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        double tempt = abs(x[i] - x[j]) / abs(v[i] - v[j]);
        if (tempt > eps && tempt < mint) mint = tempt;
      }
    }
    t -= mint;
    for (int i = 0; i < n; i++) {
      x[i] += mint * v[i];
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (abs(x[i] - x[j]) < eps) {
          double v1 = ((m[i] - m[j]) * v[i] + 2 * m[j] * v[j]) / (m[i] + m[j]);
          double v2 = ((m[j] - m[i]) * v[j] + 2 * m[i] * v[i]) / (m[i] + m[j]);
          v[i] = v1;
          v[j] = v2;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%.9lf\n", x[i]);
  }
  return 0;
}
