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

struct node {
    int l, r, num, sum = 0;
    int ll, rr;
};

signed main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int,int> > a(n + 1);
    set<int> s;
    s.insert(0);
    s.insert(m);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;
        s.insert(max(a[i].first - a[i].second, 0ll));
        s.insert(min(a[i].first + a[i].second, m));
    }
    vector<int> b;
    b.push_back(-1);
    for (auto &i: s)
        b.push_back(i);
    int N = b.size() - 1;
    vector<node> c(4 * N + 1);
    function<void(int,int,int)> init = [&](int k,int l,int r)-> void {
        if (l == r) {
            c[k].l = c[k].r = b[l];
            return;
        }
        int mid = (l + r) >> 1;
        init(k << 1, l, mid);
        init(k << 1 | 1, mid + 1, r);
        c[k].l = c[k << 1].l;
        c[k].r = c[k << 1 | 1].r;
    };
    init(1, 1, N);

    function<void(int,int,int,int,int,int z)> add = [&](int k,int l,int r,int x,int y,int z)-> void {
        if (l == x && r == y) {
            c[k].num += z;
            if (c[k].num) {
                c[k].sum = c[k].r - c[k].l;
                c[k].ll = c[k].rr = 1;
                return;
            } else if(l==r){
                c[k].sum = 0;
                c[k].ll = c[k].rr = 0;
                return ;
            }

        }
        if(c[k].ll&&c[k].rr) {
            c[k<<1].num+=c[k].num;
            c[k<<1|1].num+=c[k].num;
            c[k<<1].ll=c[k<<1].rr=c[k<<1|1].ll=c[k<<1|1].rr=1;
        }
        int mid = (l + r) >> 1;
        if (y <= mid) {
            add(k << 1, l, mid, x, y, z);
        } else if (x > mid) {
            add(k << 1 | 1, mid + 1, r, x, y, z);
        } else {
            add(k << 1, l, mid, x, mid, z);
            add(k << 1 | 1, mid + 1, r, mid + 1, y, z);
        }
        c[k].sum = c[k << 1].sum + c[k << 1 | 1].sum;
        if (c[k << 1].rr && c[k << 1 | 1].ll) {
            c[k].sum += c[k << 1 | 1].l - c[k << 1].r;
        }
        c[k].ll = c[k << 1].ll;
        c[k].rr = c[k << 1 | 1].rr;
    };
    cout<<fixed<<setprecision(10);
    map<pair<int,int>,int> mp;
    for (int i = 1; i <= n; i++) {
        mp[a[i]]++;
        int ll = lower_bound(b.begin(), b.end(), max(a[i].first - a[i].second, 0ll)) - b.begin();
        int rr = lower_bound(b.begin(), b.end(), min(a[i].first + a[i].second, m)) - b.begin();
        // cout<<ll<<" "<<rr<<" "<<a[i].first<<" "<<a[i].second<<endl;
        if (mp[a[i]] & 1)
            add(1, 1, N, ll, rr, 1);
        else
            add(1, 1, N, ll, rr, -1);
        cout << c[1].sum * sqrt(2) << '\n';
    }
    return 0;
}