#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

double dist(double sx, double sy, double tx, double ty) {
  return sqrt((tx - sx) * (tx - sx) + (ty - sy) * (ty - sy));
}

int main() {
  int n, w; cin >> n >> w;
  vector<int> x(n), y(n), r(n), v(n), a(n); REP(i, n) cin >> x[i] >> y[i] >> r[i] >> v[i] >> a[i];
  auto sushi_pos = [&](double t, int sushi) -> pair<double, double> {
    return {x[sushi] + r[sushi] * cos((v[sushi] * t + a[sushi]) * M_PI / 180),
            y[sushi] + r[sushi] * sin((v[sushi] * t + a[sushi]) * M_PI / 180)};
  };
  auto f = [&](double t, double runx, double runy, int sushi) {
    double lb = t, ub = t + dist(runx, runy, x[sushi], y[sushi]) / w + 1000;
    REP(_, 80) {
      double m = (lb + ub) / 2;
      auto [sx, sy] = sushi_pos(m, sushi);
      (dist(runx, runy, sx, sy) < w * (m - t + EPS) ? ub : lb) = m;
    }
    return ub;
  };
  vector dp(1 << n, vector(n, 1. * LINF));
  REP(i, n) dp[1 << i][i] = f(0, 0, 0, i);
  FOR(b, 1, 1 << n) REP(p, n) {
    if (b >> p & 1) {
      auto [sx, sy] = sushi_pos(dp[b][p], p);
      REP(i, n) {
        if (b >> i & 1) continue;
        chmin(dp[b | (1 << i)][i], f(dp[b][p], sx, sy, i));
      }
    }
  }
  double ans = LINF;
  REP(i, n) chmin(ans, dp[(1 << n) - 1][i]);
  cout << ans << '\n';
  return 0;
}