using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, w) = (c[0], c[1]);
        var map = NArr(n);
        var bitmax = 1 << n;
        var INF = double.MaxValue / 2;
        var dp = new double[bitmax][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = Enumerable.Repeat(INF, n).ToArray();
        dp[0][0] = 0;
        for (var j = 0; j < n; ++j)
        {
            dp[1 << j][j] = MoveNext(0, 0, 0, w, map[j]);
        }
        for (var b = 1; b < bitmax; ++b)
        {
            for (var i = 0; i < n; ++i)
            {
                if (((b >> i) & 1) == 0) continue;
                var pos = GetPos(dp[b][i], map[i]);
                for (var j = 0; j < n; ++j)
                {
                    if (((b >> j) & 1) != 0) continue;
                    dp[b | (1 << j)][j] = Math.Min(dp[b | (1 << j)][j], MoveNext(pos.x, pos.y, dp[b][i], w, map[j]));
                }
            }
        }
        WriteLine(dp[^1].Min().ToString("0.00000000"));
    }
    static (double x, double y) GetPos(double t, int[] s)
    {
        return (s[0] + s[2] * Math.Cos((s[3] * t + s[4]) * Math.PI / 180),
            s[1] + s[2] * Math.Sin((s[3] * t + s[4]) * Math.PI / 180));
    }
    static double MoveNext(double x, double y, double t, int w, int[] s)
    {
        var ok = 600.0 / w;
        var ng = 0.0;
        while (ok - ng > 0.0000001)
        {
            var mid = (ok + ng) / 2;
            var npos = GetPos(t + mid, s);
            if (Math.Sqrt((x - npos.x) * (x - npos.x) + (y - npos.y) * (y - npos.y)) <= w * mid) ok = mid;
            else ng = mid;
        }
        return t + ok;
    }
}