#include <bits/stdc++.h>
typedef long double ld;
const ld inf=1e12;
using namespace std;
struct nd{
	ld x,y;
	int id;
	nd operator -(nd &a){
		return {x-a.x,y-a.y,id};
	}
	ld operator *(nd a){
		return x*a.y-y*a.x;
	}
}a[200010],b[200010],c[200010],st[200010];
int n,m,k,t;
ld ans[200010];
void in(nd a){
	while(t>1&&(a-st[t])*(a-st[t-1])>=0) t--;
	st[++t]=a;
}
ld slope(nd a){
	return a.y/a.x;
}
ld qry(nd a){
	int l=2,r=t,mid,ans=1;
	while(l<=r){
		mid=(l+r)>>1;
		if((a-st[mid-1])*(a-st[mid])>=0) ans=mid,l=mid+1;
		else r=mid-1;
	}
	return -slope(a-st[ans]);
}
int main(){
	scanf("%d",&n);
	for(int i=0;i<=n;i++) scanf("%Lf%Lf",&a[i].y,&a[i].x),a[i].id=i;
	for(int i=n;i>=0;i--) a[i]=a[i]-a[0];
	for(int i=1;i<=n;i++){
		if(a[i].x&&a[i].y*a[i].x<=0) ans[i]=-slope(a[i]);
		else ans[i]=2*inf;
//		cerr<<(int)a[i].x<<" "<<(int)a[i].y<<"\n";
	}
	
	m=k=t=0;
	for(int i=1;i<=n;i++){
		if(a[i].y>0) c[++m]=a[i];
		else if(a[i].x>0) b[++k]=a[i];
	}
	sort(c+1,c+m+1,[](nd &a,nd &b){return a.x<b.x;});
	sort(b+1,b+k+1,[](nd &a,nd &b){return a.x<b.x;});
	for(int i=m,j=k;i>=1;i--){
		while(j>=1&&b[j].x>c[i].x) in(b[j]),j--;
		if(t) ans[c[i].id]=min(ans[c[i].id],qry(c[i]));
	}
	
	m=k=t=0;
	for(int i=1;i<=n;i++){
		if(a[i].y<0) c[++m]={-a[i].x,-a[i].y,a[i].id};
		else if(a[i].x<0) b[++k]={-a[i].x,-a[i].y,a[i].id};
	}
	sort(c+1,c+m+1,[](nd &a,nd &b){return a.x<b.x;});
	sort(b+1,b+k+1,[](nd &a,nd &b){return a.x<b.x;});
	for(int i=m,j=k;i>=1;i--){
		while(j>=1&&b[j].x>c[i].x) in(b[j]),j--;
		if(t) ans[c[i].id]=min(ans[c[i].id],qry(c[i]));
	}
	
	for(int i=1;i<=n;i++){
		if(ans[i]>inf) puts("-1");
		else printf("%.14Lf\n",ans[i]);
	}
}