#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,X;
#define pb push_back
vector<int>g[1001000];
int Z[200100];
int xp[1001000];
int m,t;
struct no{ll x,y;int z;}a[401000],b[401000];
no operator - (const no &a,const no &b){return (no){a.x-b.x,a.y-b.y,a.z-b.z};}
__int128 cro(no a,no b){return (__int128)a.x*b.y-(__int128)b.x*a.y;}
#define mp make_pair
#define F first
#define S second
#define db double
db ans[201000];
const db eps=1e-9;
int main(){
    scanf("%d%d",&n,&X);
    for(int i=1,l,y,r,h;i<=n;i++){
        scanf("%d%d%d%d",&l,&y,&r,&h);r+=l;
        Z[i]=y;ll y_=1ll*y*y+1ll*l*l;
        a[++m]=(no){2*l,y_,i};
        if(l==r)continue;
        y_=1ll*y*y+1ll*r*r;
        a[++m]=(no){2*r,y_,i};
        //(x-l)^2+y^2
        int L=max(0,l),R=min(X,r);
        if(l<r)g[l].pb(i),g[r].pb(-i);
    }
    sort(a+1,a+m+1,[&](no a,no b){if(a.x!=b.x)return a.x<b.x;if(a.y!=b.y)return a.y<b.y;return a.z<b.z;});
    for(int i=1;i<=m;i++){
        if(i>1&&a[i].x==a[i-1].x)continue;
        while(t>1&&cro(b[t]-b[t-1],a[i]-b[t-1])<=0)t--;
        b[++t]=a[i];
    }
    vector<pair<db,pair<int,int> > >jd;
    int w=1;
    while(w<t&&b[w].y>b[w+1].y)w++;
    jd.pb(mp(0,mp(w,0)));
    for(int i=w;i<t;i++)
        jd.pb(mp(1.0*(b[i+1].y-b[i].y)/(b[i+1].x-b[i].x),mp(i+1,0)));
    set<pair<int,int> >s;
    for(int i=0;i<X;i++){
        for(int o:g[i])if(o>0)s.insert(make_pair(Z[o],o));
        else s.erase(make_pair(Z[-o],-o));
        if(!s.empty())xp[i]=(*s.begin()).second;
        if(i==0||xp[i]!=xp[i-1])jd.pb(mp(i,mp(xp[i],1)));
    }
    jd.pb(mp(X,mp(0,2)));
    sort(jd.begin(),jd.end());
    int v1=0,v2=0;int sz=jd.size();
    for(int i=0;i<sz;i++){
        auto it=jd[i];
        if(it.S.S==2)break;
        auto it2=jd[i+1];
        if(it.S.S==0)v1=it.S.F;else v2=it.S.F;
        if(!v1)continue;
        db L=it.F,R=it2.F;
        if(!v2)ans[b[v1].z]+=R-L;
        else{
            db p=-b[v1].x,q=b[v1].y-1ll*Z[v2]*Z[v2];
            //x^2+px+q<0
            db dt=p*p-q*4;
            if(dt<eps)ans[v2]+=R-L;
            else{
                dt=sqrt(dt);
                db kl=max(L,(-p-dt)/2),kr=min(R,(-p+dt)/2),lt=max(0.0,kr-kl);
                ans[b[v1].z]+=lt,ans[v2]+=R-L-lt;
            }
        }
    }
    for(int i=1;i<=n;i++)printf("%.9lf\n",ans[i]/X*100);
    return 0;
}