#include<bits/stdc++.h>
#define N 200005
#define ll long long
#define LL __int128
using namespace std;
const ll JD=1e9,INFll=3e18;
const LL _1=1,INF=1e36;
int n,v0;
ll x0,ans[N];
struct node{
	ll x;
	int v,id;
}a[N];
inline bool cmp(node a,node b){return a.x<b.x;}
struct line{
	int k;
	LL b;
	inline LL calc(ll x){return _1*k*x+b;}
};
namespace tree1{
	line tree[N];
	int root,cnt,L[N],R[N];
	LL mn[N];
	inline int news(){
		cnt++;
		tree[cnt]=(line){0,INF};
		mn[cnt]=INF;
		L[cnt]=R[cnt]=0;
		return cnt;
	}
	void inserts(int &rt,ll l,ll r,line v){
		if(!rt){
			rt=news();
			tree[rt]=v;
			mn[rt]=v.calc((l+r)>>1);
			return;
		}
		ll mid=(l+r)>>1;
		mn[rt]=min(mn[rt],v.calc(mid));
		if(v.calc(mid)<tree[rt].calc(mid)) swap(tree[rt],v);
		if(l==r) return;
		if(v.calc(l)<tree[rt].calc(l)) inserts(L[rt],l,mid,v);
		if(v.calc(r)<tree[rt].calc(r)) inserts(R[rt],mid+1,r,v);
		return;
	}
	ll query(int rt,ll l,ll r,line li){
		if(!rt) return INFll;
		ll ans=INFll;
		if(li.k>tree[rt].k) ans=(tree[rt].b-li.b+li.k-tree[rt].k-1)/(li.k-tree[rt].k);
		if(l!=r){
			ll mid=(l+r)>>1;
			if(mn[rt]<=li.calc(mid)) ans=min(ans,query(L[rt],l,mid,li));
			else ans=min(ans,query(R[rt],mid+1,r,li));
		}
		return ans;
	}
}
namespace tree2{
	line tree[N];
	int root,cnt,L[N],R[N];
	LL mx[N];
	inline int news(){
		cnt++;
		tree[cnt]=(line){0,-INF};
		mx[cnt]=-INF;
		L[cnt]=R[cnt]=0;
		return cnt;
	}
	void inserts(int &rt,ll l,ll r,line v){
		if(!rt){
			rt=news();
			tree[rt]=v;
			mx[rt]=v.calc((l+r)>>1);
			return;
		}
		ll mid=(l+r)>>1;
		mx[rt]=max(mx[rt],v.calc(mid));
		if(v.calc(mid)>tree[rt].calc(mid)) swap(tree[rt],v);
		if(l==r) return;
		if(v.calc(l)>tree[rt].calc(l)) inserts(L[rt],l,mid,v);
		if(v.calc(r)>tree[rt].calc(r)) inserts(R[rt],mid+1,r,v);
		return;
	}
	ll query(int rt,ll l,ll r,line li){
		if(!rt) return INFll;
		ll ans=INFll;
		if(li.k<tree[rt].k) ans=(li.b-tree[rt].b+tree[rt].k-li.k-1)/(tree[rt].k-li.k);
		if(l!=r){
			ll mid=(l+r)>>1;
			if(mx[rt]>=li.calc(mid)) ans=min(ans,query(L[rt],l,mid,li));
			else ans=min(ans,query(R[rt],mid+1,r,li));
		}
		return ans;
	}
}
int main(){
	scanf("%d",&n);
	scanf("%lld%d",&x0,&v0);
	x0*=JD;
	for(int i=1;i<=n;i++) scanf("%lld%d",&a[i].x,&a[i].v),a[i].id=i;
	for(int i=1;i<=n;i++) a[i].x*=JD;
	sort(a+1,a+n+1,cmp);
	int p=0;
	while(p+1<=n&&a[p+1].x<x0) p++;
	for(int i=p+1;i<=n;i++) tree1::inserts(tree1::root,0,INFll,(line){a[i].v,a[i].x});
	tree1::inserts(tree1::root,0,INFll,(line){v0,x0});
	for(int i=1;i<=p;i++) ans[a[i].id]=tree1::query(tree1::root,0,INFll,(line){a[i].v,a[i].x});
	for(int i=1;i<=p;i++) tree2::inserts(tree2::root,0,INFll,(line){a[i].v,a[i].x});
	tree2::inserts(tree2::root,0,INFll,(line){v0,x0});
	for(int i=p+1;i<=n;i++) ans[a[i].id]=tree2::query(tree2::root,0,INFll,(line){a[i].v,a[i].x});
	for(int i=1;i<=n;i++){
		if(ans[i]==INFll) puts("-1");
		else printf("%.9f\n",ans[i]*1./JD);
	}
}