#include <bits/stdc++.h>
using namespace std;
#define OPENIOBUF

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<16;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
};

class FastOutput final: public FastIOBase
{
 private:
	void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	void __write(T x)
	{
		char stk[64],*top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
	~FastOutput() { flush(); }
	void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
	FastOutput &operator <<(char x)
	{ return __putc(x),*this; }
	FastOutput &operator <<(const char *s)
	{ for(;*s;__putc(*(s++)));return *this; }
	FastOutput &operator <<(const std::string &s)
	{ return (*this)<<s.c_str(); }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(const T &x)
	{ return __write(x),*this; }
	template<typename ...T>
	void writesp(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	void writeln(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	template<typename Iter>
	void writesp(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<' '; }
	template<typename Iter>
	void writeln(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;

class FastInput final: public FastIOBase
{
 private:
	bool __eof;
 public:
	FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
	{ buf_p=BUFSIZE; }
	void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
	bool eof()const { return buf[buf_p]==EOF; }
#else
	{}
	bool eof()const { return feof(target); }
#endif
	char get()
	{
		if(__eof) return EOF;
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		char ch=buf[buf_p++];
#else
		char ch=getc(target);
#endif
		return ~ch?ch:(__eof=true,EOF);
	}
	void unget(char c)
	{
		__eof=false;
#ifdef OPENIOBUF
		buf_p--;
#else
		ungetc(c,target);
#endif
	}
	explicit operator bool()const { return !__eof; }
	FastInput &operator >>(char &x)
	{ while(isspace(x=get()));return *this; }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
	{
		char ch,sym=0;x=0;
		while(isspace(ch=get()));
		if(__eof) return *this;
		if(ch=='-') sym=1,ch=get();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
		return unget(ch),sym?x=-x:x,*this;
	}
	FastInput &operator >>(char *s)
	{
		while(isspace(*s=get()));
		if(__eof) return *this;
		for(;!isspace(*s) && !__eof;*(++s)=get());
		return unget(*s),*s='\0',*this;
	}
	FastInput &operator >>(std::string &s)
	{
		char str_buf[(1<<8)+1]={0},*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=get()));
		if(__eof) return *this;
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
			if(p!=buf_end) break;
			s.append(str_buf);
		}
		unget(*p),*p='\0',s.append(str_buf);
		return *this;
	}
	template<typename ...T>
	void read(T &...x)
	{ std::initializer_list<int>{(this->operator>>(x),0)...}; }
	template<typename Iter>
	void read(Iter begin,Iter end)
	{ while(begin!=end) (*this)>>*(begin++); }
}qin;

} // namespace FastIO
using FastIO::qin,FastIO::qout;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) void()
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif

namespace Math
{

// A class for 2D vectors.
template<typename T>
struct Vector2d
{
#define DEF_OP1(op) \
	Vector2d &operator op##=(const Vector2d &rhs) \
	{ return x op##= rhs.x,y op##= rhs.y,*this; } \
	Vector2d operator op(const Vector2d &rhs)const \
	{ return Vector2d(*this)op##=rhs; }
	T x,y;
	Vector2d(): x(0),y(0){}
	Vector2d(T _x,T _y): x(_x),y(_y){}
	DEF_OP1(+) DEF_OP1(-) DEF_OP1(*) DEF_OP1(/)
	Vector2d &operator *=(T scale)
	{ return x*=scale,y*=scale,*this; }
	friend Vector2d operator *(T scale,const Vector2d &u)
	{ return Vector2d(u)*=scale; }
	friend Vector2d operator *(const Vector2d &u,T scale)
	{ return Vector2d(u)*=scale; }
	friend auto cross(const Vector2d &u,const Vector2d &v)
	{ return u.x*v.y-u.y*v.x; }
	friend auto dot(const Vector2d &u,const Vector2d &v)
	{ return u.x*v.x+u.y*v.y; }
	friend auto abs(const Vector2d &u)
	{ return hypot(u.x,u.y); }
	friend auto abs2(const Vector2d &u)
	{ return u.x*u.x+u.y*u.y; }
	friend auto arg(const Vector2d &u)
	{ return atan2(u.y,u.x); }
	auto proj(const Vector2d &u)const
	{ return (*this)*(dot(u,*this)/abs2(*this)); }
	auto trunc(T r=1)const
	{ T l=abs(*this);return sgn(l)?(*this)*(r/l):*this; }
	auto rotate(T t)const
	{ return Vector2d(x*cos(t)-y*sin(t),x*sin(t)+y*cos(t)); }
	bool operator <(const Vector2d &rhs)const
	{ return x!=rhs.x?x<rhs.x:y<rhs.y; }
	bool operator ==(const Vector2d &rhs)const
	{ return FEQ(x,rhs.x) && FEQ(y,rhs.y); }
	bool operator !=(const Vector2d &rhs)const
	{ return FNE(x,rhs.x) || FNE(y,rhs.y); }
#undef DEF_OP1
};

} // namespace Math
using RVec=Math::Vector2d<LD>;

constexpr int V=1e6;
int n,W,m,a[300005],b[300005];

map<int,int> mp;
int f[300005][20],dep[300005];
RVec p[300005];
RVec intersect(int x,int y)
{
	if(x==1) return RVec(W,b[y]);
	if(y==1) return RVec(W,b[x]);
	return RVec(LD(a[x]-a[y])*W/(a[x]-a[y]-b[x]+b[y]),
				-((LD)a[y]*b[x]-(LD)a[x]*b[y])/(a[x]-a[y]-b[x]+b[y]));
}
void norm(LL &num,LL &den)
{
	LL g=__gcd(num,den);
	num/=g,den/=g;
}
void add(int u,int fa)
{
	f[u][0]=fa,dep[u]=dep[fa]+1;
	for(int i=1;(1<<i)<=dep[u];i++)
		f[u][i]=f[f[u][i-1]][i-1];
	mp[a[u]]=u;
	p[u]=intersect(u,fa);
}
int lca(int u,int v)
{
	if(dep[u]<dep[v]) swap(u,v);
	for(int i=18;i>=0;i--)
		if(dep[f[u][i]]>=dep[v])
			u=f[u][i];
	if(u==v) return u;
	for(int i=18;i>=0;i--)
		if(f[u][i]!=f[v][i])
			u=f[u][i],v=f[v][i];
	return f[u][0];
}

int main()
{
	qin>>n>>W;
	m=3,dep[1]=1;
	a[2]=b[2]=0,add(2,1);
	a[3]=b[3]=V+1,add(3,1);
	for(int o=1;o<=n;o++)
	{
		int opt,s,t;
		qin>>s>>t>>opt;
		auto it=mp.lower_bound(s);
		RVec vs(0,s),vt(W,t);
		int u=prev(it)->second,v=it->second,w=lca(u,v);
		for(int i=18;i>=0;i--)
			if(dep[f[u][i]]>dep[w] && cross(vt-vs,p[f[u][i]]-vs)<0)
				u=f[u][i];
		for(int i=18;i>=0;i--)
			if(dep[f[v][i]]>dep[w] && cross(vt-vs,p[f[v][i]]-vs)>0)
				v=f[v][i];
		if(u!=w && cross(vt-vs,p[u]-vs)<0)
			u=f[u][0];
		if(v!=w && cross(vt-vs,p[v]-vs)>0)
			v=f[v][0];
		w=(u==w?v:v==w?u:0);
		assert(w);
		LL xnum=(w==1?W:LL(s-a[w])*W),xden=(w==1?1:(s-a[w]-t+b[w])),
		   ynum=(w==1?t:-((LL)a[w]*t-(LL)s*b[w])),yden=(w==1?1:(s-a[w]-t+b[w]));
		norm(xnum,xden);
		norm(ynum,yden);
		qout<<'('<<xnum<<'/'<<xden<<','
				 <<ynum<<'/'<<yden<<")\n";
		if(opt) m++,a[m]=s,b[m]=t,add(m,w);
	}
	return 0;
}
/*
4 3
1 2 1
2 1 1
3 1 0
3 2 1

*/