#include<bits/stdc++.h>
using namespace std;
const int M=1005,inf=1e9;
const double eps=1e-6;
int n,D;
double dis[M];
int dcmp(double x){
	if(fabs(x)<eps)return 0;
	return x>0?1:-1;
}
typedef pair<double,int> Pi;
struct node{
	int x,y;
}A[M],V[M];
#define fi first
#define se second

vector<int>update(int x){
	vector<int>Q;
	for(int i=1;i<=n;i++){
		if(i==x)continue;
		int x1=A[x].x-A[i].x;
		int y1=V[x].x-V[i].x;
		int x2=A[x].y-A[i].y;
		int y2=V[x].y-V[i].y;

		int A1=(y1*y1+y2*y2);
		int B1=2*(x1*y1+x2*y2);
		int C1=(x1*x1+x2*x2)-D*D;

		if(A1==0){
            if(C1<=0){
                if(dcmp(dis[i]-dis[x])>0){
                    dis[i]=dis[x];
                    Q.push_back(i);
                }
            }
		}else{
            if(B1*B1<4*A1*C1){
                continue;
            }else{
                double delta=sqrt(1.0*B1*B1-4.0*A1*C1);
                double tl=(-B1-delta)/(2.0*A1),tr=(-B1+delta)/(2.0*A1);
                if(dcmp(dis[x]-tr)<0){
                    double val=max(dis[x],tl);
                    if(dcmp(dis[i]-val)>0){
                        dis[i]=val;
                        Q.push_back(i);
                    }
                }
            }
		}
	}
	return Q;
}
void solve(){
	priority_queue<Pi,vector<Pi>,greater<Pi>>Q;
	Q.push({0,0});
	while(!Q.empty()){
		auto now=Q.top();
		Q.pop();
		int x=now.se;
		if(dcmp(now.fi-dis[x])>0)continue;
		vector<int>val=update(x);
		for(auto v:val){
			Q.push({dis[v],v});
		}
	}
}
int main(){
	scanf("%d %d",&n,&D);
	for(int i=1;i<=n;i++)dis[i]=inf;
	for(int i=0;i<=n;i++){
		int x,y,a,b;
		scanf("%d %d",&x,&y);
		scanf("%d %d",&a,&b);
		A[i]={x,y};
		V[i]={a,b};
	}
	solve();
	for(int i=1;i<=n;i++){
		if(dis[i]==inf){
			printf("-1\n");
		}else {
			printf("%.10f\n",dis[i]);
		}
	}
	return 0;
}