#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pii pair<int, int>
#define ls k << 1
#define rs k << 1 | 1
void solve();
const int N = 400005;
const int INF = 1e18;
int n, m, nn;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
//    cin >> T;
    while (T--)solve();
    return 0;
}
#define double long double
vector<int> t(1);
int _find(int x){
    return lower_bound(t.begin() + 1, t.end(), x) - t.begin();
}
struct Node{
    int l, r;
    int minn;
    int cnt;
    int pl, pr;
    int tag;
}tr[N << 2];
void update(int k, int v){
    tr[k].tag += v;
    tr[k].minn += v;
}
Node merge(Node l, Node r){
    Node temp = l;
    temp.minn = min(l.minn, r.minn);
    if (l.minn == r.minn) temp.cnt = l.cnt + r.cnt;
    else if (l.minn < r.minn) temp.cnt = l.cnt;
    else temp.cnt = r.cnt;
    temp.tag = 0;
    temp.l = l.l, temp.r = r.r;
    temp.pl = l.pl, temp.pr = r.pr;
    return temp;
}
void push_up(int k){
    tr[k] = merge(tr[ls], tr[rs]);
}
void push_down(int k){
    update(ls, tr[k].tag);
    update(rs, tr[k].tag);
    tr[k].tag = 0;
}
void build(int k, int l, int r){
    tr[k].l = l, tr[k].r = r;
    tr[k].minn = INF;
    tr[k].cnt = 0;
    tr[k].tag = 0;
    if (l == r){
        tr[k].minn = 0;
        tr[k].cnt = t[l] - t[l - 1];
        tr[k].pl = t[l - 1];
        tr[k].pr = t[l];
        return ;
    }
    int mid = l + r >> 1;
    build(ls, l, mid);
    build(rs, mid + 1, r);
    push_up(k);
}
void modify(int k, int l, int r, int v){
    if (l <= tr[k].l && r >= tr[k].r){
        update(k, v);
        return ;
    }
    push_down(k);
    int mid = tr[k].l + tr[k].r >> 1;
    if (l <= mid) modify(ls, l, r, v);
    if (r > mid) modify(rs, l, r, v);
    push_up(k);
}
Node query(int k, int l, int r){
    if (l <= tr[k].l && r >= tr[k].r){
        return tr[k];
    }
    int mid = tr[k].l + tr[k].r >> 1;
    if (r <= mid) return query(ls, l, r);
    else if (l >= mid + 1) return query(rs, l, r);
    else return merge(query(ls, l, r), query(rs, l, r));
}
void solve(){
    cin>>n;
    cin>>m;
    set<array<int,3>>st;
    set<array<int,3>>st2;
    const double  T = sqrtl(2);
    vector< array<int, 3> > qq;
    for(int i=1;i<=n;i++){
        int x,y;
        cin>>x>>y;
        int op=0;
        if(st.find({y-x,x,y})!=st.end()){
            st.erase({y-x,x,y});
            op=-1;
        }
        else{
            st.insert({y-x,x,y});
            op=1;
        }
        if(st2.find({y+x,x,y})!=st2.end()){
            st2.erase({y+x,x,y});
        }
        else{
            st2.insert({y+x,x,y});
        }
        int l=y-x,r=x+y;
        if(l<0){
            l*=-1;
        }
        else l=0;
        if(r>m){
            r=m;
        }
        else{

        }
        //l r op
        t.push_back(l);
        t.push_back(r);
        qq.push_back({op, l, r});
//        cout << "l = " << l << ' ' << "r = " << r << endl;
    }
    t.push_back(m);
    sort(t.begin() + 1, t.end());
    t.erase(unique(t.begin() + 1, t.end()), t.end());
    nn = t.size() - 1;
    build(1, 1, nn);
//    cout << query(1, 1, nn).minn << ' ' << query(1, 1, nn).cnt << endl;
    for (int i = 0; i < qq.size(); i++){
        int op = qq[i][0], l = qq[i][1], r = qq[i][2];
        l = _find(l) + 1, r = _find(r);
        modify(1, l, r, op);
//        cout << "l = " << l << ' ' << "r = " << r << ' ' << "op = " << op << endl;
        Node tmp = query(1, 1, nn);
        int cnt = 0;
        if (!tmp.minn) cnt = tmp.cnt;
//        cout << "cnt = " << cnt << endl;
        cout << fixed << setprecision(20) << (m - cnt) * T << endl;
    }
}