#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define EPS 1e-10
void doubleIntSort(double d[],int m[],int s){int i,j,r;double k1,k2,t;if(s<=1)return;k1=(d[0]+d[s-1])/2.0;k2=k1+EPS;k1-=EPS;i=-1;j=s;for(;;){while(d[++i]<k1);while(d[--j]>k2);if(i>=j)break;t=d[i];d[i]=d[j];d[j]=t;r=m[i];m[i]=m[j];m[j]=r;}doubleIntSort(d,m,i);doubleIntSort(d+j+1,m+j+1,s-j-1);}

double X[50000], Y[50000], Z[50000];
double a[50000], b[50000]; int ind[50000];
int main(){
  int N; double L, R;
  int i;
  double A, B, C, now, pi = acos(0)*2;

  assert( scanf("%d%lf%lf",&N,&L,&R)==3 );
  assert( 1<=N && N<=50000 );
  assert( -1000 <= L && L < R && R <= 1000 );

  rep(i,N){
    assert( scanf("%lf%lf%lf",X+i,Y+i,Z+i)==3 );
    assert( -1000<=X[i] && X[i]<=1000 );
    assert( 0<Y[i] && Y[i]<=1000 );
    assert( 15<=Z[i] && Z[i]<=75 );
    Z[i] = tan(Z[i]*pi/180);
  }

  A = 0; B = 1000;
  while(B-A > 1e-6){
    C = (A+B)/2;

    rep(i,N){
      if(Y[i] <= C){ a[i] = b[i] = -1e100; continue; }
      a[i] = X[i] - (Y[i]-C) * Z[i];
      b[i] = X[i] + (Y[i]-C) * Z[i];
    }
    rep(i,N) ind[i] = i;
    doubleIntSort(a, ind, N);

    now = L;
    rep(i,N){
      if(a[i] > now) break;
      if(now < b[ind[i]]) now = b[ind[i]];
    }

    if(now >= R) A=C; else B=C;
  }

  printf("%.10f\n",(A+B)/2);

  return 0;
}