/*
O(n^2)暴力DP，f表示这天有多少人民币，转移时就转换成券来求
A表示A券价值，B表示B券价值，S表示这个券的数量 题意得：A*Sa+B*Sb=F，Sa/Sb=R(A*R+B)*Sb=F;Sb=F/(A*R+B);  Sa=Sb*R;
*/
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
double a[110000],b[110000],r[110000],f[110000];
int main()
{int n;memset(f,0,sizeof(f));scanf("%d%lf",&n,&f[0]);for(int i=1;i<=n;i++){scanf("%lf%lf%lf",&a[i],&b[i],&r[i]);f[i]=f[i-1];for(int j=i-1;j>=1;j--){//劵->钱double Sa,Sb;//劵数 Sb=f[j]/(a[j]*r[j]+b[j]);Sa=Sb*r[j];f[i]=max(f[i],a[i]*Sa+b[i]*Sb);}}printf("%.3lf\n",f[n]);return 0;
}

/*
玄学bzoj数据，官方数据本机1.8s跑过提交TLE，其他也是跑1.8s的splay提交1s
*/
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
const double inf=1e11;
const double eps=0e-8;double a[110000],b[110000],r[110000],f[110000];
//double x[110000],y[110000];
double poiX(int j){return f[j]/(a[j]*r[j]+b[j])*r[j];}
double poiY(int j){return f[j]/(a[j]*r[j]+b[j]);}struct node
{double x,y,lk,rk;int f,l,r,son[2];
}tr[110000];int len,root;
double slope(node n1,node n2)
{if(n1.y==-1){if(fabs(n1.x)<=eps)return inf;else                return -inf;}if(n2.y==-1){if(fabs(n2.x)<=eps)return inf;else                return -inf;}return (n1.y-n2.y)/(n1.x-n2.x);
}void rotate(int x,int w)
{int f=tr[x].f,ff=tr[f].f;int R,r;R=f;r=tr[x].son[w];tr[R].son[1-w]=r;if(r!=0)tr[r].f=R;R=ff;r=x;if(tr[R].son[0]==f)tr[R].son[0]=r;else if(tr[R].son[1]==f)tr[R].son[1]=r;tr[r].f=R;R=x;r=f;tr[R].son[w]=r;tr[r].f=R;
}
void splay(int x,int rt)
{while(tr[x].f!=rt){int f=tr[x].f,ff=tr[f].f;if(ff==rt){if(tr[f].son[0]==x)rotate(x,1);else if(tr[f].son[1]==x)rotate(x,0);}else{if(tr[ff].son[0]==f&&tr[f].son[0]==x){rotate(f,1);rotate(x,1);}else if(tr[ff].son[1]==f&&tr[f].son[1]==x){rotate(f,0);rotate(x,0);}else if(tr[ff].son[0]==f&&tr[f].son[1]==x){rotate(x,0);rotate(x,1);}else if(tr[ff].son[1]==f&&tr[f].son[0]==x){rotate(x,1);rotate(x,0);}}}if(rt==0)root=x;
}//---------splay内部操作------------------------ double findmax(int i,double k)
{
/*    double ss=0;for(int j=3;j<=len;j++){if(tr[tr[j].f].son[0]==j||tr[tr[j].f].son[1]==j||tr[j].f==0)ss=max(ss,a[i]*tr[j].x+b[i]*tr[j].y);}return ss;*/int now=root;while(now!=0){int lc=tr[now].son[0],rc=tr[now].son[1];if(tr[now].lk<k&&tr[now].rk<k)now=lc;else if(tr[now].lk>k&&tr[now].rk>k)now=rc;else return a[i]*tr[now].x+b[i]*tr[now].y;}
}int findqianqu(double x)
{int now=root,ret=-1;while(now!=0){if(tr[now].x<x){ret=now;now=tr[now].son[1];}else now=tr[now].son[0];}return ret;
}
int findhouji(double x)
{int now=root,ret=-1;while(now!=0){if(tr[now].x>x){ret=now;now=tr[now].son[0];}else now=tr[now].son[1];}return ret;
}
//--------------find----------------------
void del(int dl,int dr)
{if(tr[dl].x>tr[dr].x)return ;int l=findqianqu(tr[dl].x),r=findhouji(tr[dr].x);splay(l,0);splay(r,l);tr[r].son[0]=0;
}
void debug(int now)
{int L,R;int l=tr[now].l,ll=tr[l].l;L=now;R=l;while(ll!=1&&ll!=0){double sp=slope(tr[ll],tr[now]);//决定l是否删 if(sp>tr[l].lk&&sp<tr[l].rk){tr[len].l=ll;tr[ll].r=len;tr[len].lk=tr[ll].rk=slope(tr[ll],tr[len]);L=l, l=ll, ll=tr[l].l;}else break;}del(L,R);int r=tr[now].r,rr=tr[r].r;L=r;R=now;while(rr!=2&&rr!=0){double sp=slope(tr[now],tr[rr]);if(sp>tr[r].lk&&sp<tr[r].rk){tr[len].r=rr;tr[rr].l=len;tr[len].rk=tr[rr].lk=slope(tr[len],tr[rr]);R=r, r=rr, rr=tr[r].r;}else break;}del(L,R);
}
//-------------debug----------------------
void add(int i,int f)
{len++;tr[len].x=poiX(i);tr[len].y=poiY(i);tr[len].f=f;tr[len].son[0]=tr[len].son[1]=0;tr[f].son[0]=len;
}
void ins(int i)
{node tno;tno.x=poiX(i);tno.y=poiY(i);int L=findqianqu(poiX(i));int R=findhouji (poiX(i));double sp=tr[L].rk;double spl=slope(tr[L],tno),spr=slope(tno,tr[R]);if(L==1||R==2||(spl>sp&&sp>spr)){splay(L,0);splay(R,L);add(i,R);tr[len].l=L;tr[len].r=R;tr[L].r=len;tr[R].l=len;tr[len].lk=tr[L].rk=slope(tr[L],tr[len]);tr[len].rk=tr[R].lk=slope(tr[len],tr[R]);splay(len,0);debug(len);splay(len,0);}
}//----------splay外部操作------------void yu()
{len=root=3;tr[1].x=0.0;tr[1].y=-1;tr[1].f=3;tr[1].l=tr[1].r=0;tr[2].x=inf;tr[2].y=-1;tr[2].f=3;tr[2].l=tr[2].r=0;tr[1].r=len;tr[2].l=len;tr[1].son[0]=tr[1].son[1]=0;tr[2].son[0]=tr[2].son[1]=0;tr[1].lk=inf, tr[2].rk=-inf;tr[3].x=poiX(1);tr[3].y=poiY(1);tr[3].f=0;tr[3].l=1;tr[3].r=2;tr[3].son[0]=1;tr[3].son[1]=2;tr[3].lk=tr[1].rk=slope(tr[1],tr[3]);tr[3].rk=tr[2].lk=slope(tr[3],tr[2]);
}/*
int tt[11000],tlen;
void dfs(int x)
{if(tr[x].son[0]!=0)dfs(tr[x].son[0]);tt[++tlen]=x;if(tr[x].son[1]!=0)dfs(tr[x].son[1]);
}
*/
int main()
{//freopen("cash.in","r",stdin);//freopen("cash.out","w",stdout);int n;memset(f,0,sizeof(f));scanf("%d%lf",&n,&f[0]);f[1]=f[0];for(int i=1;i<=n;i++)scanf("%lf%lf%lf",&a[i],&b[i],&r[i]);yu();//x[1]=poiX(1);y[1]=poiY(1);for(int i=2;i<=n;i++){f[i]=max( f[i-1],findmax(i,-a[i]/b[i]) );    //    x[i]=poiX(i);y[i]=poiY(i);
        ins(i);/*        double ss=0;for(int j=3;j<=len;j++)if(tr[tr[j].f].son[0]==j||tr[tr[j].f].son[1]==j||tr[j].f==0)if(tr[j].lk<tr[j].rk){printf("%d\n",i);return 0;}*//*        tlen=0;dfs(root);for(int j=1;j<=tlen;j++)printf("%d ",tt[j]);printf("\n");*/}//    for(int i=1;i<=n;i++)printf("%.3lf\n",f[i]);printf("%.3lf\n",f[n]);return 0;
}

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
const double inf=-2147483647.0;
const double eps=1e-8;struct query
{int t;double a,b,r,sp;
}Q[110000];
bool cmp(query a,query b){return a.sp>b.sp;}struct point
{double x,y;
}P[110000];
double slope(int i,int j)
{if(fabs(P[i].x-P[j].x)<=eps)return -inf;return (P[i].y-P[j].y)/(P[i].x-P[j].x);
}//-----------------------------------double f[110000];
int top,sta[110000];
void solve(int l,int r)
{int mid=(l+r)/2;top=0;for(int i=l;i<=mid;i++)//形成凸包
    {while(top>1&&slope(sta[top-1],sta[top])<slope(sta[top],i))top--;sta[++top]=i;}int p=1;for(int i=mid+1;i<=r;i++){while(p<top&&slope(sta[p],sta[p+1])>Q[i].sp)p++;f[Q[i].t]=max(f[Q[i].t],P[sta[p]].x*Q[i].a+P[sta[p]].y*Q[i].b);}        }query t1[110000];point t2[110000];
void cdq(int l,int r)
{if(l==r){f[Q[l].t]=max(f[Q[l].t-1],f[Q[l].t]);P[l].x=f[Q[l].t]/(Q[l].a*Q[l].r+Q[l].b)*Q[l].r;P[l].y=f[Q[l].t]/(Q[l].a*Q[l].r+Q[l].b);return ;}int mid=(l+r)/2,i,j,p;//！！！！i=l,j=mid+1,p=l;while(p<=r){if(Q[p].t<=mid)t1[i++]=Q[p];else t1[j++]=Q[p];p++;}for(int i=l;i<=r;i++)Q[i]=t1[i];cdq(l,mid);solve(l,r);cdq(mid+1,r);i=l,j=mid+1,p=l;while(i<=mid&&j<=r){if(P[i].x<P[j].x)t2[p++]=P[i++];else t2[p++]=P[j++];}while(i<=mid)t2[p++]=P[i++];while(j<=r)  t2[p++]=P[j++];for(int i=l;i<=r;i++)P[i]=t2[i];
}int main()
{
//    freopen("cash.in","r",stdin);
//    freopen("cash.out","w",stdout);int n;scanf("%d%lf",&n,&f[0]);for(int i=1;i<=n;i++){scanf("%lf%lf%lf",&Q[i].a,&Q[i].b,&Q[i].r);Q[i].sp=-Q[i].a/Q[i].b;Q[i].t=i;}sort(Q+1,Q+n+1,cmp);cdq(1,n);printf("%.3lf\n",f[n]);return 0;
}