import sys

# sys.setrecursionlimit(1000006)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from math import sin,cos,radians

def ok(m):
    t=m+pre
    p=x+R*cos(radians(v*t+a))
    q=y+R*sin(radians(v*t+a))
    return (cx-p)**2+(cy-q)**2<=(m*w)**2

n,w=LI()
xa=LLI(n)

dp=[[inf]*n for _ in range(1<<n)]
pos=[[(0,0)]*n for _ in range(1<<n)]
dp[0][0]=0
for s in range(1<<n):
    for i in range(n):
        pre=dp[s][i]
        if pre==inf:continue
        cx,cy=pos[s][i]
        for j in range(n):
            if s>>j&1:continue
            x,y,R,v,a=xa[j]
            ns=s|1<<j
            l,r=0,500
            for _ in range(40):
                m=(l+r)/2
                if ok(m):
                    r=m
                else:
                    l=m
            t=pre+l
            if t<dp[ns][j]:
                dp[ns][j]=t
                p = x+R*cos(radians(v*t+a))
                q = y+R*sin(radians(v*t+a))
                pos[ns][j]=(p,q)

print(min(dp[-1]))