// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 5e5 + 5;

int N, L;
double t[MAXN], v[MAXN];

void input()
{
    scanf("%d%d", &N, &L);
    for (int i = 1; i <= N; ++i) {
        scanf("%lf%lf", &t[i], &v[i]);
        t[i] *= v[i];
    }
}

void solve()
{
    static int q[MAXN];
    int front = 0, rear = 0;
    double sumt = 0, sumv = 0;

    for (int i = 1; i <= N; ++i) {
        double left = L - v[i];
        for (; front < rear && sumv > left; ++front) {
            int j = q[front];
            sumt -= t[j];
            sumv -= v[j];
            if (sumv <= left) {
                double c = (left - sumv) / v[j];
                sumt += (t[j] *= c);
                sumv += (v[j] *= c);
                break;
            }
        }
        assert(fabs(sumv - left) < 1e-8);
        double ans = (sumt + t[i]) / L;
        printf("%.10f\n", ans);

        double t0 = t[i], v0 = v[i];
        for (; front < rear && t[q[rear - 1]] / v[q[rear - 1]] >= t0 / v0; --rear) {
            t0 += t[q[rear - 1]];
            v0 += v[q[rear - 1]];
        }
        q[rear++] = i;
        sumt += t[i]; t[i] = t0;
        sumv += v[i]; v[i] = v0;
        // printf("i=%d:\n", i);
        // for (int j = front; j < rear; ++j) {
        //     printf("(%f,%f) ", v[q[j]], t[q[j]]);
        // }
        // puts("");
    }
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 不入虎穴，焉得虎子?


Measured memory_bytes: 20224