#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define db double
#define N 100050
const db eps = 1e-8;
const db inf = 1e10;
int n;
db dp[N];
struct node
{db a,b,r,x,y,k;int id;
}p[N],tmp[N];
db slop(node n1,node n2)
{if(fabs(n1.x-n2.x)<=eps)return inf;return (n1.y-n2.y)/(n1.x-n2.x);
}
bool cmpid(node n1,node n2)
{return n1.id<n2.id;
}
bool cmpk(node n1,node n2)
{return n1.k<n2.k;
}
void Sort(int l,int r)//cmp x
{int mid = (l+r)>>1;int i=l,j = mid+1,k = l-1;while(i<=mid&&j<=r){while(i<=mid&&p[i].x<=p[j].x)tmp[++k]=p[i++];while(j<=r&&p[i].x>p[j].x)tmp[++k]=p[j++];}while(i<=mid)tmp[++k]=p[i++];while(j<=r)tmp[++k]=p[j++];for(i=l;i<=r;i++)p[i]=tmp[i];
}
void divi(int l,int r)
{int mid = (l+r)>>1;int i=l-1,j=mid;for(int k=l;k<=r;k++){if(p[k].id<=mid)tmp[++i]=p[k];else tmp[++j]=p[k];}for(int k=l;k<=r;k++)p[k]=tmp[k];
}
int sta[N],tl;
void cdq(int l,int r)
{if(l==r){dp[l] = max(dp[l],dp[l-1]);p[l].x = dp[l]/(p[l].a*p[l].r+p[l].b);p[l].y = p[l].x*p[l].r;return ;}int mid = (l+r)>>1;divi(l,r);cdq(l,mid);tl = 0;for(int i=l;i<=mid;i++){while(tl>=2&&slop(p[sta[tl]],p[i])+eps>slop(p[sta[tl]],p[sta[tl-1]]))tl--;sta[++tl] = i;}for(int i=mid+1;i<=r;i++){while(tl>=2&&slop(p[sta[tl]],p[sta[tl-1]])<p[i].k+eps)tl--;dp[p[i].id] = max(dp[p[i].id],p[sta[tl]].x*p[i].b+p[sta[tl]].y*p[i].a);}cdq(mid+1,r);Sort(l,r);
}
int main()
{scanf("%d%lf",&n,&dp[0]);for(int i=1;i<=n;i++){scanf("%lf%lf%lf",&p[i].a,&p[i].b,&p[i].r);p[i].k = -p[i].b/p[i].a;p[i].id = i;}sort(p+1,p+1+n,cmpk);cdq(1,n);printf("%.3lf\n",dp[n]);return 0;
}