#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42;

struct info
{
    double mini;
    double lazy;
    int id;
};
info tree[nmax*4];

void push(int node)
{
    tree[node*2].lazy+=tree[node].lazy;
    tree[node*2+1].lazy+=tree[node].lazy;
    tree[node].lazy=0;
}

info actual(info a)
{
    a.mini=a.mini-a.lazy;
    a.lazy=0;
    return a;
}
info my_merge(info a,info b)
{
    a=actual(a);
    b=actual(b);

    if(a.mini<b.mini)return a;
    return b;
}
void update(int node,int l,int r,int lq,int rq,double val)
{
    if(l==lq&&r==rq)
    {
        tree[node].lazy+=val;
        return;
    }

    push(node);

    int av=(l+r)/2;

    if(lq<=av)update(node*2,l,av,lq,min(av,rq),val);
    if(av<rq)update(node*2+1,av+1,r,max(av+1,lq),rq,val);

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);
}

void force(int node,int l,int r,int pos,double val)
{
    if(l==r)
    {
        tree[node].lazy=0;
        tree[node].mini=val;
        return;
    }

    push(node);

    int av=(l+r)/2;

    if(pos<=av)force(node*2,l,av,pos,val);
    else force(node*2+1,av+1,r,pos,val);

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);
}

void build(int node,int l,int r)
{
    if(l==r)
    {
        tree[node].mini=1e18;

        tree[node].id=l;

        return;
    }

    int av=(l+r)/2;

    build(node*2,l,av);
    build(node*2+1,av+1,r);

    tree[node]=my_merge(tree[node*2],tree[node*2+1]);
}
int n,v;

struct inf
{
    long long t,s;
    int id;
};
inf inp[nmax];

bool cmp(inf a,inf b)
{
    return a.t<b.t;
}

int active=0;
double t=0;

double outp[nmax];

void push_active(long long wall)
{
    while(active&&t<wall)
    {
        info me=actual(tree[1]);

        pair<double,int> cur={me.mini,me.id};

        //cout<<"t= "<<t<<" active= "<<active<<" cur= "<<cur.first<<" "<<cur.second<<endl;

        if(t+cur.first/(1.0*v/active)<=wall)
        {
            t=t+cur.first/(1.0*v/active);

            outp[cur.second]=t;

            double red=cur.first;

            update(1,1,n,1,n,red);

            outp[cur.second]=t;

            active--;

            force(1,1,n,cur.second,1e18);
        }
        else
        {
            double red=(wall-t)*(1.0*v/active);

            update(1,1,n,1,n,red);

            t=wall;

            //cout<<"red= "<<red<<endl;

            break;
        }
    }

    t=wall;
}

int main()
{
    freopen("transfer.in","r",stdin);
    freopen("transfer.out","w",stdout);

    scanf("%i%i",&n,&v);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&inp[i].t,&inp[i].s);
        inp[i].id=i;
    }

    sort(inp+1,inp+n+1,cmp);

    build(1,1,n);

    for(int i=1;i<=n;i++)
    {
        push_active(inp[i].t);

        active++;
        force(1,1,n,inp[i].id,inp[i].s);
    }

    push_active(1e18);

    for(int i=1;i<=n;i++)printf("%.18f\n",outp[i]);

    return 0;
}