#include <bits/stdc++.h>
using namespace std;
void RI(int& x) {
  x = 0;
  char c = getchar();
  while (!(c >= '0' && c <= '9' || c == '-')) c = getchar();
  bool flag = 1;
  if (c == '-') {
    flag = 0;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  if (!flag) x = -x;
}
void RII(int& x, int& y) { RI(x), RI(y); }
void RIII(int& x, int& y, int& z) { RI(x), RI(y), RI(z); }
void RC(char& c) {
  c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
}
char RC() {
  char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
const long long mod = 1e9 + 7;
const long long LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;
const double PI = acos(-1.0);
double dp[1 << 20];
bool vis[1 << 20];
struct Point {
  double x, y, angle;
  friend double dist(const Point& a, const Point& b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
  }
  Point(double a, double b, double c) : x(a), y(b), angle(c) {}
};
void init() {
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i <= (1 << 20) - 1; i++) {
    dp[i] = -LINF;
  }
}
double cal(Point po, double x) {
  double d1 = dist(po, Point(x, 0, 0));
  double ang1 = acos((po.x - x) / d1);
  double ang2 = PI - ang1 - po.angle;
  if (ang2 <= 0) return INF;
  return d1 * sin(po.angle) / sin(ang2) + x;
}
int main() {
  init();
  int n;
  double l, r;
  cin >> n >> l >> r;
  vector<Point> vec;
  for (int i = 1; i <= n; i++) {
    double x, y, angle;
    cin >> x >> y >> angle;
    angle = PI * angle / 180.0;
    vec.push_back(Point(x, y, angle));
  }
  queue<int> q;
  for (int i = 0; i <= n - 1; i++) {
    dp[1 << i] = cal(vec[i], l);
    q.push(1 << i);
    vis[1 << i] = true;
  }
  while ((int)q.size()) {
    int tx = q.front();
    q.pop();
    vis[tx] = false;
    for (int i = 0; i <= n - 1; i++) {
      if (!((1 << i) & tx)) {
        int sx = tx | (1 << i);
        double t = cal(vec[i], dp[tx]);
        if (t > dp[sx]) {
          dp[sx] = t;
          if (!vis[sx]) {
            vis[sx] = true;
            q.push(sx);
          }
        }
      }
    }
  }
  double maxx = dp[(1 << n) - 1];
  maxx = min(maxx, r);
  printf("%.12f\n", maxx - l);
}
