#include<bits/stdc++.h>
#define err() cout<<"err "<<__LINE__<<endl,exit(0);
#define pot(args...) PPT("Line",__LINE__,":",#args,":",args) 
#define F(i,s,t) for(ll i=(s);i<=(t);i++) 
#define DEL [[deprecated]]
using namespace std;void PPT(){cout<<"\n";}template<typename TYPE,typename... TYPES>void PPT(const TYPE& x,const TYPES&... y){cout<<x<<' ';PPT(y...);}
typedef long long ll;
#define db double
#define ep 1e-6
#define pai 3.14159265358
#define g 9.8
#define x first
#define y second
#define inf 1e18
const int N = 2e3 + 5;
db v,w,r,tha,ax=0,at=inf;
int n;
pair<db,db>c;
pair<int,int>p[N];
db f1 (db t) { return cos (tha - t * w) * w * r + g * t; }
db f2 (db t) { return sin (tha - t * w) * w * r + v; }
db calc1 (db L) { return (sin (tha) - sin (tha - L * w)) * r + L * L / 2 * g; } 
db calc2 (db L) { return (cos (tha - L * w) - cos (tha)) * r + L * v; }
db ftp (db L, db R) {
    for (int t = 50; t; -- t) {
        db len = (R - L) / 3, m1 = L + len, m2 = R - len;
        (f1 (m1) < f1 (m2)) ? L = m1 : R = m2;
    }
    return L;
}
ll rd(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	return x*f;
}
db cl(ll x,ll y,db &an){
     if(!y){
          an=x;return 0;
     }
     r=sqrt((c.x-x)*(c.x-x)+(c.y-y)*(c.y-y));
     tha=atan2(y-c.y,x-c.x);
     db st=tha/w,T=pai/w,tp =ftp(st-T/2,st+T/2),shi=(st+T/2-tp)*2;
     swap(tp,st);
     if(st>0)st-=floor(st/(2*T))*2*T;
     if(st<0)st+=ceil((-st)/(2*T))*2*T;
     if(shi<ep){
        db L=0,R=2e5;
        for (int t=50;t;--t) {
            db mid=(L+R)/2;
            calc1(mid)>=y?R=mid:L=mid;
        }
        return an=x+calc2(L),L;
    }
    auto findrt=[&](db L)->db{
        db R=L+shi;
        if(f1(R)>=0)return inf;
        for(int t=30;t;--t){
            db mid=(L+R)/2;
            f1(mid)>=0?L=mid:R=mid;
        }
        return L;
    };
    db lt=findrt(st-2*T),ret=0,tot;
    if(fabs(lt-inf)<ep)ret=0;
    else{
        int L=0,R=2e5;
        if(lt>=0)st-=2*T;
        while(L<=R){
            int mid=(L+R)>>1;
            db lp=findrt(st+2*mid*T);
            !(fabs(lp-inf)<ep)?tot=mid,ret=lp,L=mid+1:R=mid-1;
        }
    }
    if(calc1(ret)<y){
        db L=ret,R=1e6;
        for(int t=50;t;--t){
            db mid=(L+R)/2;
            calc1(mid)>=y?R=mid:L=mid;
        }
        ret=L;
    }
    else{
        int L=0,R=tot,pt=-1;
        db lm;
        while(L<=R){
            int mid=(L+R)>>1;
            db lp=findrt(st+2*mid*T);
            assert(!(fabs(lt-inf)<ep));
            calc1(lp)>=y?lm=lp,pt=mid,R=mid-1:L=mid+1;
        }
        assert ( ~ pt);
        db A=st+2*(pt-1)*T+shi,B=lm;
        for(int t=50;t;--t){
            db mid=(A+B)/2;
            calc1(mid)>=y?B=mid:A=mid;
        }
        ret=A;
    }
    return an=x+calc2(ret),ret;
}
int main(){

     n=rd();v=rd();w=rd();
     F(i,1,n){
          p[i].x=rd();p[i].y=rd();
          c.x+=p[i].x;c.y+=p[i].y;
     }
     c.x/=n;c.y/=n;
     F(i,1,n){
          db nx,nt;
          nt=cl(p[i].x,p[i].y,nx);
          if(at>nt){
               at=nt;ax=nx;
          }
     }
     printf("%.6lf",ax);
     return 0;
}