#include <bits/stdc++.h>
using namespace std;
#define int     long long
#define pb      push_back
#define all(x)  (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fs      first
#define sc      second
#define Inf (1ll<<62)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef long double ld;

int n;

void problem() {
	int w;
	cin>>n>>w;
	vector<pair<pii,pii>> Ent(n);
	for(int i=0;i<n;i++){
		cin>>Ent[i].fs.fs>>Ent[i].fs.sc>>Ent[i].sc.fs;
		Ent[i].sc.sc=i;
	}
	sort(all(Ent));
	vector<priority_queue<pair<ld,int>,vector<pair<ld,int>>,greater<pair<ld,int>>>> Pq(100);
	vector<pair<ld,ld>> Lazy(100,{1,0});
	int ind=0;
	int sum=0;
	ld elapsed=0;
	vector<ld> Ans(n,0);
	while(ind<n || sum){
		pair<ld,int> Mi={Inf,Inf};
		for(int i=0;i<100;i++){
			if(!Pq[i].empty()){
				Mi=min(Mi,{Lazy[i].fs*Pq[i].top().fs+Lazy[i].sc,i});
			}
		}
		if(ind==n){
			ld pase=Mi.fs;
			for(int i=0;i<100;i++){
				if(sum)
				Lazy[i].sc-=pase;
			}
			elapsed+=pase;
			Ans[Pq[Mi.sc].top().sc]=elapsed;
			Pq[Mi.sc].pop();
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc/=sum;
				Lazy[i].fs/=sum;	
				}
			}
			sum-=Mi.sc+1;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc*=sum;
				Lazy[i].fs*=sum;	
				}	
			}
			continue;
		}
		if(!sum){
			ld pase=Ent[ind].fs.fs-elapsed;
			for(int i=0;i<100;i++){
				if(sum)
				Lazy[i].sc-=pase;
			}
			elapsed+=pase;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc/=sum;
				Lazy[i].fs/=sum;	
				}	
			}
			sum+=Ent[ind].sc.fs;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc*=sum;
				Lazy[i].fs*=sum;	
				}		
			}
			ld rem=((ld)Ent[ind].fs.sc*sum)/(Ent[ind].sc.fs*w);
			Pq[Ent[ind].sc.fs-1].push({(rem-Lazy[Ent[ind].sc.fs-1].sc)/Lazy[Ent[ind].sc.fs-1].fs,Ent[ind].sc.sc});
			ind++;
			continue;
		}	
		if(Mi.fs<Ent[ind].fs.fs-elapsed){
			ld pase=Mi.fs;
			for(int i=0;i<100;i++){
				if(sum)
				Lazy[i].sc-=pase;
			}
			elapsed+=pase;
			Ans[Pq[Mi.sc].top().sc]=elapsed;
			Pq[Mi.sc].pop();
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc/=sum;
				Lazy[i].fs/=sum;	
				}
			}
			sum-=Mi.sc+1;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc*=sum;
				Lazy[i].fs*=sum;	
				}	
			}
			
		}else{
			ld pase=Ent[ind].fs.fs-elapsed;
			for(int i=0;i<100;i++){
				if(sum)
				Lazy[i].sc-=pase;
			}
			elapsed+=pase;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc/=sum;
				Lazy[i].fs/=sum;	
				}	
			}
			sum+=Ent[ind].sc.fs;
			for(int i=0;i<100;i++){
				if(sum==0){
					Lazy[i]={1,0};
				}else{
				Lazy[i].sc*=sum;
				Lazy[i].fs*=sum;	
				}		
			}
			ld rem=((ld)Ent[ind].fs.sc*sum)/(Ent[ind].sc.fs*w);
			Pq[Ent[ind].sc.fs-1].push({(rem-Lazy[Ent[ind].sc.fs-1].sc)/Lazy[Ent[ind].sc.fs-1].fs,Ent[ind].sc.sc});
			ind++;
		}
	}
	for(auto a:Ans){
		cout<<a<<'\n';
	}

}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.setf(ios_base::fixed);
	cout.precision(10);
	int tc = 1;
	//cin >> tc;
	while (tc--) {
		problem();
		cout << "\n";
	}

	return 0;
}