#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define PI 3.14159265358979323846

struct S {
	int x,y,r;
	double v,a;
} s[12];
int n;
double w;

double limit=2000;
double dp[1<<12][12];

static inline
double sq(double x){
	return x*x;
}

static inline
double f(double ix,double iy,double it,int j){
	double lo=0;
	double hi=(sqrt(sq(s[j].x-ix)+sq(s[j].y-iy))+s[j].r)/w;
	for(int k=0;k<18;++k){
		double mid=(lo+hi)*.5;
		double jt=it+mid;
		double ja=s[j].a+s[j].v*jt;
		double jx=s[j].x+s[j].r*cos(ja);
		double jy=s[j].y+s[j].r*sin(ja);
		if(sq(jx-ix)+sq(jy-iy)<sq(mid*w)){
			hi=mid;
		}else{
			lo=mid;
		}
	}
	return it+hi;
}

main(){
	scanf("%d%lf",&n,&w);
	for(int i=0;i<n;++i){
		scanf("%d%d%d%lf%lf",&s[i].x,&s[i].y,&s[i].r,&s[i].v,&s[i].a);
		s[i].v*=PI/180;
		s[i].a*=PI/180;
	}
	for(int m=0;m<1<<n;++m){
		for(int j=0;j<n;++j){
			dp[m][j]=limit;
		}
	}
	for(int j=0;j<n;++j){
		dp[1<<j][j]=f(0,0,0,j);
	}
	for(int m=0;m<1<<n;++m){
		for(int i=0;i<n;++i){
			if(m&1<<i){
				double it=dp[m][i];
				double ia=s[i].a+s[i].v*it;
				double ix=s[i].x+s[i].r*cos(ia);
				double iy=s[i].y+s[i].r*sin(ia);
				for(int j=0;j<n;++j){
					if(~m&1<<j&&dp[m|1<<j][j]>it){
						double r=f(ix,iy,it,j);
						if(dp[m|1<<j][j]>r){
							dp[m|1<<j][j]=r;
						}
					}
				}
			}
		}
	}
	double z=limit;
	for(int j=0;j<n;++j){
		double r=dp[(1<<n)-1][j];
		if(z>r){
			z=r;
		}
	}
	printf("%f",z);
}