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

#define tsolve int t; cin >> t; while(t--) solve
#define debug(x) cerr << __LINE__ << ": "#x" = " << (x) << endl
#define all(x) ::begin(x), ::end(x)
#define sz(x) (int)::size(x)
using ll = long long;
using ld = long double;

const ld s2 = sqrtl(2);

constexpr int NODES = 2e7, MAX = 1<<30;
int nn = 2;

int mi[NODES], cnt[NODES], lazy[NODES], L[NODES], R[NODES];

int w;

void push(int i, int l, int m, int r){
	l = min(l, w);
	m = min(m, w);
	r = min(r, w);
	if(L[i] == 0) L[i] = nn, cnt[nn] = m-l, nn++;
	if(R[i] == 0) R[i] = nn, cnt[nn] = r-m, nn++;
	mi[L[i]] += lazy[i];
	mi[R[i]] += lazy[i];
	lazy[L[i]] += lazy[i];
	lazy[R[i]] += lazy[i];
	lazy[i] = 0;
}

void add(int ql, int qr, int x, int l = 0, int r = MAX, int i = 1){
	if(ql <= l && r <= qr){
		mi[i] += x;
		lazy[i] += x;
		return;
	}
	else if(qr <= l || r <= ql) return;
	int m = (l + r) / 2;
	push(i, l, m, r);
	add(ql, qr, x, l, m, L[i]);
	add(ql, qr, x, m, r, R[i]);
	mi[i] = min(mi[L[i]], mi[R[i]]);
	cnt[i] = 0;
	if(mi[L[i]] == mi[i]) cnt[i] += cnt[L[i]];
	if(mi[R[i]] == mi[i]) cnt[i] += cnt[R[i]];
}

void solve() {
	int q;
	cin >> q >> w;
	cnt[1] = w;
	set<pair<int, int>> s;
	for(int qq = 0; qq < q; qq++){
		int x, y;
		cin >> x >> y;
		int l = max(0, x-y);
		int r = min(w, x+y);
		int val = 1;
		if(s.count(make_pair(x, y))){
			val = -1;
			s.erase(make_pair(x, y));
		}
		else s.emplace(x, y);
		add(l, r, val);;
		int ans = w - cnt[1];
		if(mi[1] > 0) ans = w;
		cout << (s2 * ans) << "\n";
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}