# include <bits/stdc++.h>
using namespace std;
const long long maxn = 5e5+5;
struct segment
{
    pair <double,long long> segm[maxn];

    double lazy[maxn];
    void recalc(long long v, long long l, long long r)
    {
        if(lazy[v]==0)return ;
        segm[v].first+=lazy[v];
        if(l!=r)
        {
            lazy[2*v]+=lazy[v];
            lazy[2*v+1]+=lazy[v];
        }
        lazy[v] = 0;
    }
    void update(long long v, long long from, long long to, long long l, long long r,  double delta)
    {
        recalc(v,from,to);
        if(l<=from&&to<=r)
        {
            lazy[v]+=delta;
            if(l==r)
                segm[v].second = l;
                recalc(v,from,to);
            return ;
        }long long mid = (from+to)/2;
        recalc(2*v,from,mid);
        recalc(2*v+1,mid+1,to);

        if(l<=mid)update(2*v,from,mid,l,r,delta);
        if(r>mid)update(2*v+1,mid+1,to,l,r,delta);
        segm[v] = min(segm[2*v],segm[2*v+1]);
    }
   pair <double, long long> query(long long v, long long from, long long to, long long l, long long r)
    {
        recalc(v,from,to);
        if(l<=from&&to<=r)
        {

            return segm[v];
        }
        long long mid = (from+to)/2;
        recalc(2*v,from,mid);
        recalc(2*v+1,mid+1,to);
        pair <double,long long> ans;
        if(l<=mid)ans = query(2*v,from,mid,l,r);
        if(r>mid)ans = min(ans,query(2*v+1,mid+1,to,l,r));
       return ans;
    }
};
segment S;
struct queries
{
    long long x,id,m;
     double ans;
};
queries p[maxn];
bool cmp (queries i, queries j)
{
    return i.x<j.x;
}
bool cmp2 (queries i, queries j)
{
    return i.id<j.id;
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  freopen("transfer.in","r",stdin);
  freopen("transfer.out","w",stdout);
long long n,m,i,j;
double v;
cin>>n>>v;
for(i=1;i<=n;i++)
{
    cin>>p[i].x>>p[i].m;
    p[i].id = i;
}
sort(p+1,p+n+1,cmp);
long long from = 1;
for(i=1;i<=n;i++)
{
    S.update(1,1,n,i,i,p[i].m);
}
double last = 0.0;
long long left = 0;
for(i=1;i<=n;i++)
{
   // cout<<i<<" : "<<endl;
    while(left)
    {
        auto w = S.query(1,1,n,1,i-1);
        if(w.first<( double)(p[i].x-last)*(v/(left)))
        {
           //cout<<"READY "<<w.second<<" "<<w.first<<endl;
             double curr  =last+( double)w.first/(v/left);
           // cout<<curr<<endl;
             S.update(1,1,n,1,i-1,-v/left*(curr-last));
            p[w.second].ans = curr;
            //cout<<w.second<<" "<<curr<<" "<<p[w.second].ans<<endl;
           last = curr;left--;
            S.update(1,1,n,w.second,w.second,1e18);
        }
        else
            break;

    }
    if(left)
    {
         S.update(1,1,n,1,i-1,-v/left*(p[i].x-last));
    }
    last = p[i].x;
    long long k = i;
    while(i<=n&&p[k].x==p[i].x)
    {
        i++;
        left++;
    }
    i--;
}
 while(left)
    {
        auto w = S.query(1,1,n,1,n);

//cout<<":: "<<w.second<<" "<<w.first<<endl;
            p[w.second].ans = last+w.first/(v/left);
             double curr = last+w.first/(v/left);

          S.update(1,1,n,1,i-1,-v/left*(curr-last));

           last = curr;left--;
            S.update(1,1,n,w.second,w.second,1e18);


    }
    sort(p+1,p+n+1,cmp2);
    for(i=1;i<=n;i++)
       printf("%.6f\n",p[i].ans);// cout<<p[i].ans<<endl;
return 0;
}