#include <bits/stdc++.h>

using namespace std;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)

#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
template<class t>using vc=vector<t>;

#define a first
#define b second

using vi=vc<int>;

using ld=long double;
const ld inf=1./0;

using T=tuple<int,int,int,int>;

void slv(){
	int n;cin>>n;
	double w;cin>>w;
	vc<T> ls(n);
	vi ps(n);
	rep(i,n){
		int t,s,p;cin>>t>>s>>p;
		ls[i]=T(t,s,p,i);
		ps[i]=p;
	}
	sort(all(ls));
	vc<ld> ans(n);
	
	ld cur=0;
	int psum=0;
	using P=pair<ld,int>;
	priority_queue<P,vc<P>,greater<P>> pq;
	ld b=0;
	auto next_finish=[&](){
		if(pq.empty())return inf;
		return cur+(pq.top().a+b)*psum;
	};
	auto add=[&](ld s,ld p,int i){
		pq.emplace(s/(w*p)-b,i);
		psum+=ps[i];
	};
	auto pop=[&](){
		auto [tmp,i]=pq.top();pq.pop();
		//cerr<<i<<" "<<tmp+b<<endl;
		psum-=ps[i];
		ans[i]=cur;
	};
	auto proceed=[&](ld t){
		ld e=t-cur;cur=t;
		if(psum==0)b=0;
		else b-=e/psum;
	};
	
	int head=0;
	while(1){
		ld z=next_finish();
		if(head<n&&get<0>(ls[head])<z){
			auto [t,s,p,i]=ls[head++];
			proceed(t);
			add(s,p,i);
		}else{
			if(z==inf)break;
			proceed(z);
			pop();
		}
	}
	
	rep(i,n)cout<<ans[i]<<"\n";
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(10);
	
	slv();
}