#include<bits/stdc++.h>
namespace FRTMLV{
#define ll long long 
#define LD long double
#define i7 __int128
#define re return
#define con continue
using namespace std;
template<class T>inline bool ckmin(T &a,T b){re b<a?a=b,1:0;}
template<class T>inline bool ckmax(T &a,T b){re a<b?a=b,1:0;}
const int N=6e5+5;
inline int rd(){
	int ans=0,f=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')f^=(ch=='-'),ch=getchar();
	while(ch>='0'&&ch<='9')ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
	re f?-ans:ans;
}
const int MX=1e6+1;
int n,W,tt;
int nx[N][20],siz[N];
//
set<int>st;
int hd[MX+5];
//
inline i7 abs(i7 x){re x<0?-x:x;}
struct frac{
//	ll x,y;
	i7 x,y;
//	void clr(){if(y<0)y=-y,x=-x;ll g=llabs(__gcd(x,y));x/=g,y/=g;}
	void clr(){if(y<0)y=-y,x=-x;i7 g=abs(__gcd(x,y));x/=g,y/=g;}
	frac operator +(const frac &a)const{frac ans={x*a.y+y*a.x,y*a.y};ans.clr();re ans;}
	frac operator -(const frac &a)const{frac ans={x*a.y-y*a.x,y*a.y};ans.clr();re ans;}
	frac operator *(const frac &a)const{frac ans={x*a.x,y*a.y};ans.clr();re ans;}
	frac operator /(const frac &a)const{frac ans={x*a.y,y*a.x};ans.clr();re ans;}
	bool operator <(const frac &a)const{re x*a.y<a.x*y;}
	bool operator ==(const frac &a)const{re x*a.y==a.x*y;}
};
struct point{
	frac x,y;
	void out(){
		printf("(%lld/%lld,%lld/%lld)\n",(ll)x.x,(ll)x.y,(ll)y.x,(ll)y.y);
	}
}p[N];
struct line{
	frac k,b;
	inline frac gty(frac x){re k*x+b;}
};
inline frac gtx(line &l1,line &l2){re (l1.b-l2.b)/(l2.k-l1.k);}


int addfront(point P,int id){
	p[++tt]=P,siz[tt]=siz[id]+1,nx[tt][0]=id;
	for(int i=1;i<20;i++)nx[tt][i]=nx[nx[tt][i-1]][i-1];
	re tt;
}
int gt(int id,int sum){
	for(int i=19;i>=0;i--)
		if(sum>=(1<<i))sum-=1<<i,id=nx[id][i];
	re id;
}
void addback(int id,point P){
	p[++tt]=P,siz[id]++;
	int cnt=0;
	while(siz[id]-1>=(1<<(cnt+1)))++cnt;
//	int nid=gt(id,siz[id]-(1<<cnt));
	id=gt(id,siz[id]-1-(1<<cnt));
	for(int i=cnt;i;i--)nx[id][i]=tt,id=nx[id][i-1];
	nx[id][0]=tt;
}
signed main(){
	n=rd(),W=rd();
	while(n--){
		int y1=rd(),y2=rd(),fl=rd();
		frac tmp={y2-y1,W};tmp.clr();
		point P={(frac){0,1},(frac){y1,1}};
		line li={tmp,(frac){y1,1}};
		if(!tt){
			printf("(%d/1,%d/1)\n",W,y2);
			if(fl){
				p[++tt]=P;
				p[++tt]={(frac){W,1},(frac){y2,1}};
				p[++tt]={(frac){0,1},(frac){0,1}};
				nx[2][0]=1,nx[3][0]=2,nx[3][1]=1,siz[3]=3;
				hd[0]=3,st.insert(0);
				
				p[++tt]={(frac){0,1},(frac){MX,1}};
				p[++tt]={(frac){W,1},(frac){y2,1}};
				p[++tt]=P;
				nx[5][0]=4,nx[6][0]=5,nx[6][1]=4,siz[6]=3;
				hd[y1]=6,st.insert(y1);
			}
			con;
		}
		int id=hd[*(--st.lower_bound(y1))],H=id;
		int sum=siz[id]-1;
		
//		int testid=id;
//		for(int i=1;i<=siz[id];i++)printf("%d ",testid),testid=nx[testid][0];
//		puts("");
		
		for(int i=18;i>=0;i--){
			if(sum<(1<<i))con;
			int nwid=nx[id][i];
			if(li.gty(p[nwid].x)==p[nwid].y){
				id=nwid,sum-=1<<i;
				break;
			}
			if(p[nwid].y<li.gty(p[nwid].x))id=nwid,sum-=1<<i;
		}
		if(li.gty(p[id].x)==p[id].y){//split
			p[id].out();
			if(fl){
				siz[nx[id][0]]=sum,siz[H]-=sum;//
				int num1=addfront(p[id],nx[id][0]);
				int num2=addfront(P,num1);
				st.insert(y1),hd[y1]=num2;
				
				addback(H,P);
			}
			con;
		}
		//common
		point p1=p[id],p2=p[nx[id][0]],np;
		if(p2.y==(frac){1000001,1}||p1.y==(frac){0,1}||p1.x==p2.x)np={(frac){W,1},(frac){y2,1}};
//		if(p1.x==p2.x)np={(frac){W,1},(frac){y2,1}};
		else {
			frac k1=(p1.y-p2.y)/(p1.x-p2.x);
			line tmp={k1,p1.y-p1.x*k1};
			np.x=gtx(li,tmp),np.y=li.gty(np.x);
		}
		np.out();
		if(fl){
			siz[nx[id][0]]=sum,siz[H]-=sum;//
			int num1=addfront(np,nx[id][0]);
			int num2=addfront(P,num1);
			st.insert(y1),hd[y1]=num2;
			
			addback(H,np);
			addback(H,P);
		}
	}
	re 0;
}
/*
4 5
1 4 1
4 1 1
3 2 1
2 5 1


10 10
4 6 1
5 8 1
2 7 1
9 2 1
1 1 1
3 10 1
10 3 1
8 4 1
7 5 1
6 9 1


*/
}signed main(){re FRTMLV::main();}