#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
pair<lld,lld> points[1000000];

lld cross(pair<lld,lld> A, pair<lld,lld> B, pair<lld,lld> C){
	return (A.first-B.first)*(C.second-B.second)-(A.second-B.second)*(C.first-B.first);
}
lld UpperArea(vector<pair<lld,lld> > &pol){
	vector<pair<lld,lld> >H;
	trav(a,pol){
		//cout<<a.first<<" "<<a.second<<endl;
		while(H.size()>=2 && cross(H[H.size()-2],H[H.size()-1],a)>=0)H.pop_back();
		H.push_back(a);
	}//cout<<endl;
	lld ans=0;
	rep(i,0,(int)H.size()){
		//cout<<H[i].first<<" "<<H[i].second<<endl;
		ans+=cross(H[i],{0,0},H[(i+1)%H.size()]);
	}//cout<<endl;
	return max(ans,-ans);
}
lld Area(vector<pair<lld,lld> >&pol){
	lld ans=UpperArea(pol);
	rep(i,0,(int)pol.size())pol[i].second*=-1;
	ans+=UpperArea(pol);
	return ans;
}
vector<pair<lld,lld> > pol1,pol2;
int n;
lld absol(lld x){
	return max(x,-x);
}
pair<lld,lld> getclosestUp(lld S){
	lld lo=-10002;
	lld hi=10002;
	pair<lld,lld> ans={1e18,-1};
	while(hi-lo>1){
		lld mid=(hi+lo)/2;
		pol1.clear();
		pol2.clear();
		rep(i,0,n){
			if(points[i].first<=mid)pol1.push_back(points[i]);
			else pol2.push_back(points[i]);
		}
		lld A=Area(pol1);
		lld B=Area(pol2);
		ans=min(ans,{absol(absol(S)-absol(A-B)),absol(A-B)});
		//cout<<A<<" "<<B<<" "<<lo<<" "<<hi<<" "<<hi-lo<<endl;
		if(A-B>=S)hi=mid;
		else lo=mid;
	}
	return ans;
}
pair<lld,lld> getclosestDown(lld S){
	lld lo=-10002;
	lld hi=10002;
	pair<lld,lld> ans={1e18,-1};
	while(hi-lo>1){
		lld mid=(hi+lo)/2;
		pol1.clear();
		pol2.clear();
		rep(i,0,n){
			if(points[i].first<=mid)pol1.push_back(points[i]);
			else pol2.push_back(points[i]);
		}
		lld A=Area(pol1);
		lld B=Area(pol2);
		ans=min(ans,{absol(absol(S)-absol(A-B)),absol(A-B)});
		//cout<<A<<" "<<B<<" "<<lo<<" "<<hi<<" "<<hi-lo<<endl;
		if(A-B<=S)lo=mid;
		else hi=mid;
	}
	return ans;
}
void solve(){
	
	lld S;
	cin>>n>>S;
	rep(i,0,n){
		cin>>points[i].first>>points[i].second;
	}
	sort(points,points+n);
	pair<lld,lld> A={1e18,-1};
	A=min(A,getclosestUp(2*S));
	A=min(A,getclosestUp(-2*S));
	A=min(A,getclosestDown(2*S));
	A=min(A,getclosestDown(-2*S));
	//cout<<A.first<<" "<<A.second<<endl;
	cout << fixed ;
    cout << setprecision(10);
	cout<<(long double)A.second/2<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}