#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=3e5+10,K=__lg(N)+2;
int n,W,a[N],b[N],fa[K][N],dep[N];
struct cmp{
	bool operator () (const int &x,const int &y)const{
		return a[x]<a[y];
	}
};
set<int,cmp>s;
struct frac{
	ll x,y;
	frac trs()const{
		ll g=__gcd(abs(x),abs(y));
		return {x/g,y/g};
	}
	bool operator < (const frac &a)const{
		return x*a.y<y*a.x;
	}
	bool operator <= (const frac &a)const{
		return x*a.y<=y*a.x;
	}
	frac operator * (const int &a)const{
		return {x*a,y};
	}
	frac operator + (const frac &a)const{
		return {x*a.y+a.x*y,y*a.y};
	}
}r[N];
void write(frac x){
	x=x.trs(),printf("%lld/%lld",x.x,x.y);
}
frac calc(int i,int j){
	ll x=a[i]-a[j],y=b[j]-a[j]-b[i]+a[i];
	if(y<0)x=-x,y=-y;
	return {x,y};
}
int LCA(int u,int v){
	if(dep[u]<dep[v])swap(u,v);
	for(int i=K-1;~i;i--)if(dep[fa[i][u]]>=dep[v])u=fa[i][u];
	if(u==v)return u;
	for(int i=K-1;~i;i--)if(fa[i][u]^fa[i][v])u=fa[i][u],v=fa[i][v];
	return fa[0][u];
}
bool find(int p,int u,int t){
	for(int i=K-1;~i;i--){
		int v=fa[i][u];
		if(dep[v]<=t)continue;
		frac tmp=calc(v,p);
		if(tmp.x<0||!tmp.y||r[v]<tmp)
			u=v;
	}
	frac tmp=calc(u,p);
	if(r[u]<tmp||!tmp.y||tmp.x<0)u=fa[0][u];
	tmp=calc(u,p);
	if(r[u]<tmp||!tmp.y||tmp.x<0||dep[u]<=t)return 0;
	if(tmp.x>tmp.y)return 0;
	fa[0][p]=u;
	dep[p]=dep[u]+1;
	r[p]=tmp;
	for(int i=1;i<K;i++)fa[i][p]=fa[i-1][fa[i-1][p]];
	return 1;
}
int main(){
	scanf("%d%d",&n,&W);
	a[0]=b[0]=0,s.insert(0);
	a[n+1]=b[n+1]=1e6+1,s.insert(n+1);
	r[0]=r[n+1]={1,1};
	dep[0]=dep[n+1]=1;
	for(int i=0;i<K;i++)fa[i][0]=0,fa[i][n+1]=n+1;
	for(int i=1,op;i<=n;i++){
		scanf("%d%d%d",&a[i],&b[i],&op);
		auto it=s.lower_bound(i);
		int v=*it,u=*prev(it);
		if(fa[K-1][u]!=fa[K-1][v]){
			bool x=find(i,u,0),y=find(i,v,0);
			if(!x&&!y){
				dep[i]=1;
				for(int j=0;j<K;j++)fa[j][i]=i;
				r[i]=(frac){1,1};
			}
		}
		else{
			int t=LCA(u,v);
			bool x=find(i,u,dep[t]),y=find(i,v,dep[t]);
			if(!x&&!y){
				dep[i]=dep[t]+1;
				fa[0][i]=t;
				for(int j=1;j<K;j++)fa[j][i]=fa[j-1][fa[j-1][i]];
				r[i]=calc(i,t);
			}
		}
		if(op)s.insert(i);
		putchar('(');
		write(r[i]*W);
		putchar(',');
		write(r[i]*b[i]+(frac){r[i].y-r[i].x,r[i].y}*a[i]);
		puts(")");
	}
	return 0;
}