#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
struct monoid{
  int mn, sum;
  monoid(): mn(INF), sum(0){
  }
  monoid(int mn, int sum): mn(mn), sum(sum){
  }
};
monoid op(monoid A, monoid B){
  monoid ans;
  ans.mn = min(A.mn, B.mn);
  ans.sum = (A.mn == ans.mn ? A.sum : 0) + (B.mn == ans.mn ? B.sum : 0);
  return ans;
}
struct lazy_segment_tree{
  int N;
  vector<monoid> ST;
  vector<int> lazy;
  lazy_segment_tree(int n, vector<int> w){
    N = 1;
    while (N < n){
      N *= 2;
    }
    ST = vector<monoid>(N * 2 - 1);
    for (int i = 0; i < n; i++){
      ST[N - 1 + i] = monoid(0, w[i]);
    }
    for (int i = N - 2; i >= 0; i--){
      ST[i] = op(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
    lazy = vector<int>(N * 2 - 1, 0);
  }
  void push(int i){
    if (i < N - 1){
      lazy[i * 2 + 1] += lazy[i];
      lazy[i * 2 + 2] += lazy[i];
    }
    ST[i].mn += lazy[i];
    lazy[i] = 0;
  }
  void range_add(int L, int R, int x, int i, int l, int r){
    push(i);
    if (r <= L || R <= l){
      return;
    } else if (L <= l && r <= R){
      lazy[i] = x;
      push(i);
    } else {
      int m = (l + r) / 2;
      range_add(L, R, x, i * 2 + 1, l, m);
      range_add(L, R, x, i * 2 + 2, m, r);
      ST[i] = op(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
  }
  void range_add(int L, int R, int x){
    range_add(L, R, x, 0, 0, N);
  }
  monoid all(){
    push(0);
    return ST[0];
  }
};
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(20);
  int q, w;
  cin >> q >> w;
  vector<int> x(q), y(q);
  set<pair<int, int>> st;
  vector<int> t(q);
  for (int i = 0; i < q; i++){
    cin >> x[i] >> y[i];
    if (st.count(make_pair(x[i], y[i])) == 0){
      t[i] = 1;
      st.insert(make_pair(x[i], y[i]));
    } else {
      t[i] = 2;
      st.erase(make_pair(x[i], y[i]));
    }
  }
  vector<int> L(q), R(q);
  for (int i = 0; i < q; i++){
    L[i] = max(x[i] - y[i], 0);
    R[i] = min(x[i] + y[i], w);
  }
  vector<int> X = {0, w};
  for (int i = 0; i < q; i++){
    X.push_back(L[i]);
    X.push_back(R[i]);
  }
  sort(X.begin(), X.end());
  X.erase(unique(X.begin(), X.end()), X.end());
  int cnt = X.size() - 1;
  vector<int> W(cnt);
  for (int i = 0; i < cnt; i++){
    W[i] = X[i + 1] - X[i];
  }
  for (int i = 0; i < q; i++){
    L[i] = lower_bound(X.begin(), X.end(), L[i]) - X.begin();
    R[i] = lower_bound(X.begin(), X.end(), R[i]) - X.begin();
  }
  lazy_segment_tree ST(cnt, W);
  for (int i = 0; i < q; i++){
    if (t[i] == 1){
      ST.range_add(L[i], R[i], 1);
    }
    if (t[i] == 2){
      ST.range_add(L[i], R[i], -1);
    }
    monoid res = ST.all();
    int ans;
    if (res.mn == 0){
      ans = w - res.sum;
    } else {
      ans = w; 
    }
    cout << ans * sqrt(2) << '\n';
  }
}