#include<bits/stdc++.h>
using namespace std;using ll=long long;using pdi=pair<double,int>;const int N=2e5+10,p=1e2,P=p+10;
int n,m,w;struct zj{int t,s,p,id;}a[N];double now,sum,tot,ans[N];priority_queue<pdi,vector<pdi>,greater<pdi> >q[P];
void ins(int i){
	if(sum)tot+=(a[i].t-now)*w/sum;sum+=a[i].p;now=a[i].t;m++;q[a[i].p].push({tot*a[i].p+a[i].s,i});
}
int main(){
	scanf("%d%d",&n,&w);for(int i=1;i<=n;i++)scanf("%d%d%d",&a[i].t,&a[i].s,&a[i].p),a[i].id=i;
	sort(a+1,a+1+n,[](zj x,zj y){return x.t<y.t;});for(int i=1;m||i<=n;){
		double mn=1e9;int id=0;for(int j=1;j<=p;j++)if(!q[j].empty()){
			auto [s,x]=q[j].top();s-=tot*j;double t=s/j;if(t<mn)mn=t,id=j;
		}if(!id){ins(i++);continue;}
		auto [s,x]=q[id].top();s-=tot*id;double t=s/id*sum/w;
		if(i<=n&&now+t>a[i].t){ins(i++);continue;}
		tot+=w/sum*t;sum-=a[x].p;now+=t;ans[a[x].id]=now;q[id].pop();m--;
	}for(int i=1;i<=n;i++)printf("%.10lf\n",ans[i]);return 0;
}