#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n, w;
    cin>>n>>w;
    int x[13], y[13], r[13], v[13], a[13];
    for(int i=0; i<n; i++){
        cin>>x[i]>>y[i]>>r[i]>>v[i]>>a[i];
    }
    const double PI=acos(-1.0);
    double dp[12][1<<12]={};
    auto calc=[&](double x0, double y0, double t0, int i)->double{
        double left=t0, right=1e4;
        for(int t=0; t<50; t++){
            double mid=(left+right)/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<=w*(mid-t0)*w*(mid-t0)) right=mid;
            else left=mid;
        }
        return left;
    };
    for(int i=0; i<n; i++){
        for(int j=0; j<(1<<n); j++) dp[i][j]=1e18;
        dp[i][1<<i]=calc(0, 0, 0, i);
    }
    for(int i=1; i<(1<<n); i++){
        for(int j=0; j<n; j++){
            if(i&(1<<j)){
                for(int k=0; k<n; k++){
                    if(!(i&(1<<k))){
                        dp[k][i^(1<<k)]=min(calc(x[j]+r[j]*cos((v[j]*dp[j][i]+a[j])*PI/180), y[j]+r[j]*sin((v[j]*dp[j][i]+a[j])*PI/180), dp[j][i], k), dp[k][i^(1<<k)]);
                    }
                }
            }
        }
    }
    double ans=1e18;
    for(int i=0; i<n; i++) ans=min(ans, dp[i][(1<<n)-1]);
    printf("%.7lf\n", ans);
    return 0;
}