#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e5 + 10;
constexpr double eps = 1e-10;
int n, all;
int sgn(double x) {return fabs(x) < eps ? 0 : (x > 0 ? 1 : -1);}
struct Node {
	int t, s, p, id;
	double cur;
	friend bool operator < (Node x, Node y) {
		if(sgn(x.cur / x.p - y.cur / y.p)) return x.cur / x.p < y.cur / y.p;
		else return x.id < y.id;
	}
}a[N];
double ans[N];
set<Node> s;
int main() {
	//freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> all;
	for(int i = 1; i <= n; i ++) cin >> a[i].t >> a[i].s >> a[i].p, a[i].id = i, a[i].cur = a[i].s;
	sort(a + 1, a + n + 1, [&] (Node x, Node y) {return x.t < y.t;});
	double tag = 0, sum = 0;
	for(int i = 1; i <= n; i ++) {
		if(sum == 0) tag = 0;
		else tag *= (sum + a[i].p) / sum;
		sum += a[i].p;
		a[i].cur += tag * (a[i].p * all / sum);
		s.insert(a[i]);
		if(i == n) break;
		int nxt = a[i + 1].t;
		double st = a[i].t;
		while(!s.empty()) {
			auto it = s.begin();
			double w = it -> cur / (it -> p * all / sum) - tag;
			if(w + st < nxt) {
				tag += w;
				tag *= (sum - it -> p) / sum;
				sum -= it -> p;
				st += w;
				ans[it -> id] = st;
				// cout << "push:" << it -> id << '\n';
				s.erase(it);
			}
			else break;
		}
		tag += nxt - st;
	}
	// cout << "-------------\n";
	double st = a[n].t;
	while(!s.empty()) {
		auto it = s.begin();
		// cout << it -> p << ' ' << all << ' ' << sum << ' ' << it -> cur << ' ' << tag << '\n';
		double w = it -> cur / (it -> p * all / sum) - tag;
		// cout << w << '\n';
		tag += w;
		tag *= (sum - it -> p) / sum;
		sum -= it -> p;
		st += w;
		ans[it -> id] = st;
		s.erase(it);
	}
	cout << fixed << setprecision(10);
	for(int i = 1; i <= n; i ++) cout << ans[i] << '\n';
	return 0;
}