#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
typedef double ld;
typedef pair<ld,int>pdi;
const int N=200010;
int n,w;
struct ele{
	int t;
	ld s;
	int p,id;
}a[N];
struct PQ{
	//全局-，push，查询最小值，pop
	priority_queue<pdi,vector<pdi>,greater<>>q;
	double tag;
	bool empty(){
		return q.empty();
	}
	pdi top(){
		auto x=q.top();x.fi-=tag;
		return x;
	}
	void push(pdi x){
		x.fi+=tag;
		q.push(x);
	}
}q;
ld ans[N];
int pr[N];
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,w);
	for(int i=1;i<=n;i++){
		int t,s,p;read(t,s,p);
		a[i]={t,(ld)s/w/p,p,i};
		pr[i]=p;
	}
	sort(a+1,a+n+1,[](ele &x,ele &y){return x.t<y.t;});
	ld la=0;
	int ps=0;
	for(int i=1;i<=n;i++){
		auto [nowt,s,p,id]=a[i];
		if(ps){
			ld pa=(nowt-la)/ps;
			while(!q.empty() && q.top().fi<pa){
				auto [s,id]=q.top();
				ans[id]=la+s*ps;
				q.q.pop();
				q.tag+=s;
				la=la+s*ps;
				ps-=pr[id];
				if(!ps)break;
				pa=(nowt-la)/ps;
			}
			q.tag+=pa;
		}
		la=nowt;
		q.push(mp(s,id));
		ps+=p;
	}
	while(!q.empty()){
		auto [s,id]=q.top();
		ans[id]=la+s*ps;
		q.q.pop();
		q.tag+=s;
		la=la+s*ps;
		ps-=pr[id];
	}
	for(int i=1;i<=n;i++)printf("%.10lf\n",ans[i]);
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}
/*#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
typedef double ld;
typedef pair<ld,int>pdi;
const int N=200010;
int n,w;
struct ele{
	int t;
	ld s;
	int p,id;
}a[N];
struct PQ{
	//全局-，push，查询最小值，pop
	priority_queue<pdi,vector<pdi>,greater<>>q;
	double tag;
	bool empty(){
		return q.empty();
	}
	pdi top(){
		auto x=q.top();x.fi-=tag;
		return x;
	}
	void push(pdi x){
		x.fi+=tag;
		q.push(x);
	}
}q;
ld ans[N];
int pr[N];
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,w);
	for(int i=1;i<=n;i++){
		int t,s,p;read(t,s,p);
		a[i]={t,(ld)s/w/p,p,i};
		pr[i]=p;
	}
	sort(a+1,a+n+1,[](ele &x,ele &y){return x.t<y.t;});
	ld la=0;
	int ps=0;
	for(int i=1;i<=n;i++){
		auto [nowt,s,p,id]=a[i];
		if(ps){
			ld pa=(nowt-la)/ps;
			while(!q.empty() && q.top().fi<pa){
				auto [s,id]=q.top();
				ans[id]=la+s*ps;
				q.q.pop();
				q.tag+=s;
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}*/