10 10
.L.....R..
.........U
..D....D..
.R......L.
....L.....
.........D
......U...
D....R....
...U......
........L.
 5 5
DD..D
.....
LU...
U...U
.UL.U
 1 1
U
 5 5
UD..L
RRD..
..RDD
UUL..
DDLRR
 19 23
U..U..R........L...D...
.D.....UL.U.U........DR
..D.U..D....L......R...
D.......RL.L....D.....R
U..D.....U...U.L..D...U
...........L...........
U....U....D.U......LRR.
......RL...U...L.......
DLU..U......UU.U.U.D...
...........D....U......
U...DL......LL.....R...
...U..DD..........LD...
.R.........D.....UU...U
....D......R..........D
.L..........R.....L....
.R........L.LL....R....
..R...D........R....D..
.LR.R..LDU.DDRL......U.
...LL.....D.....DD.....
 11 29
URRUUDDLURLRDDLLRLDUDR.UDLLD.
LRRUDLUDLDULUDL.DURDRR.RRLLRR
D.DUDDURLRDDULDUDDUDDURRDLD.L
.RULURURRDLRRRLUUUU.RDLDLRRRL
.RLDDU.UUULUURURRLLUU.RLDRDUD
LRL.URRRDDURUURUDRRDLDDULRDRL
RLULDU.LRDUDRLDLRDDDDRUUDRDLL
DLUDURRDDUDLLDLLUURLDRUURRLUL
L.RRURRDDRRURRRDDUDRRDULR.LUR
LDLRULURRUULRDUUULLU.LLU.LLLL
DUURDULDDUDLRUUDRUULURLD.RL.U
 2 2
RD
UL
 1 10
LLLLLRRRRR
 3 3
...
...
..R
 17 13
...LD.UR.RUU.
LDLULDUDRRDRL
DD.RRLRUR.UD.
RU...D...LD..
.UR.R...URUUD
.RURD.RLR.D.R
.UUU.RU...UR.
UUUU.R.......
RL.LRU.UD.DUD
LD.DRURRLRDRL
.DR..UULUDDR.
LRLURRUUDDLUR
.LRDDLLR.L.DU
DRUDLLD.LRRU.
..DL.UDL.DUL.
U.DL..D..U.RD
RR.R...RL.L..

2 2
 4 1
 1 1
 8 3
 9 1
 94 1
 4 4
 5 2
 1 1
 24 2

#include <bits/stdc++.h>
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e2 + 5;
const double eps = 1e-9;
using namespace std;
double x[MAXN], v[MAXN], m[MAXN];
int main() {
  double t, pre = 0, cur = 0;
  int n;
  scanf("%d %lf", &n, &t);
  for (int i = 0; i < n; i++) scanf("%lf %lf %lf", x + i, v + i, m + i);
  while (1) {
    cur = 2 * t;
    for (int i = 0; i < n; i++)
      for (int j = i + 1; j < n; j++) {
        if (abs(x[i] - x[j]) < eps || abs(x[i] - x[j]) < eps) continue;
        double tmp = (x[j] - x[i]) / (v[i] - v[j]);
        if (tmp < eps) continue;
        cur = min(cur, tmp);
      }
    if (cur + pre > t) break;
    pre += cur;
    for (int i = 0; i < n; i++) x[i] += cur * 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 a = v[i], b = v[j];
          v[i] = ((m[i] - m[j]) * a + 2 * m[j] * b) / (m[i] + m[j]);
          v[j] = ((m[j] - m[i]) * b + 2 * m[i] * a) / (m[i] + m[j]);
        }
  }
  cur = t - pre;
  for (int i = 0; i < n; i++) printf("%.20f\n", x[i] + v[i] * cur);
  return 0;
}
