#include "bits/stdc++.h" #include "atcoder/all" using namespace std; using namespace atcoder; using mint = modint1000000007; const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" double dp[100005][2]; int X[12]; int Y[12]; int R[12]; int V[12]; int A[12]; int N, W; double PI = acos(-1.0); double calc(double x0, double y0, double t0, int i) { double ng = t0; double ok = INF; for (int n = 0; n < 100; ++n) { double mid = (ok + ng) / 2; double x1 = X[i] + R[i] * cos((V[i] * mid + A[i])*PI / 180) - x0; double y1 = Y[i] + R[i] * sin((V[i] * mid + A[i])*PI / 180) - y0; if ((x1*x1 + y1 * y1) <= (double)W*W*(mid - t0)*(mid - t0)) { ok = mid; } else { ng = mid; } } return ok; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N >> W; rep(i, N) { cin >> X[i] >> Y[i] >> R[i] >> V[i] >> A[i]; } //巡回セールスマン vector> dp(1 << N, vector(N, INF)); rep(i, N) { //初期値 dp[1 << i][i] = calc(0, 0, 0, i); } rep(i, (1 << N)) { rep(j, N) { if (INF == dp[i][j]) { continue; } rep(k, N) { int next = i | (1 << k); double t = dp[i][j]; double x = X[j] + R[j] * cos((V[j] * t + A[j])*PI / 180); double y = Y[j] + R[j] * sin((V[j] * t + A[j])*PI / 180); double time = calc(x, y, t, k); dp[next][k] = min(dp[next][k], time); } } } double ans = INF; for (int i = 0; i < N; ++i) { ans = min(dp[(1 << N) - 1][i], ans); } printf("%.10f\n", ans); return 0; }