#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
using Pdi = pair<double, int>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N; cin >> N;
    double L; cin >> L;
    vector<int> t(N), v(N);
    vector<double> ans(N, 0.0);
    REP(i, N) cin >> t[i] >> v[i];

    deque<Pdi> dq;
    double S = 0.0;
    int V = 0;
    REP(i, N){
        int L0 = L - v[i];
        while(V > L0){
            double s2 = dq.front().f;
            int v2 = dq.front().s;
            dq.pop_front();
            if(v2 > V - L0){
                S -= s2 * (double)(V - L0) / v2;
                s2 *= (double)(v2 - (V - L0)) / v2;
                v2 -= V - L0;
                V = L0;
                dq.push_front(Pii(s2, v2));
            }else{
                S -= s2;
                V -= v2;
            }
        }

        double s0 = t[i] * v[i];
        int v0 = v[i];
        V += v0;
        S += s0;
        while(SZ(dq) > 0 && dq.back().f / dq.back().s > s0 / v0){
            double s1 = dq.back().f;
            int v1 = dq.back().s;
            dq.pop_back();
            s0 += s1;
            v0 += v1;
        }
        dq.push_back(Pdi(s0, v0));
        
        ans[i] = S / L;
    }

    Out(ans);

    return 0;
}


Measured memory_bytes: 35968