#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define y0 M_y0
using namespace std;
typedef long long ll;
const int N=105,M=5e6+10;
const double PI=acos(-1);
int n,x0,y0,d,t;
int x[N],y[N],num;
struct node{
    double x;
    int op;
}a[M];
bool operator < (node x,node y){
    return x.x<y.x;
}
double mx=0.0,mn=1e18;
void add(double l,double r){
    a[++num]=(node){l,1};
    a[++num]=(node){r,-1};
}
void solve(double tx,double ty){
    double ang=atan2(ty,tx);if(ang<0)ang+=2*PI;
    if(d>=sqrt(tx*tx+ty*ty)){
        add(0,2*PI);
        return;
    }
    double del=asin(d/sqrt(tx*tx+ty*ty));
    double tl=ang-del,tr=ang+del;
    if(tl<0){
        add(0,tl+2*PI);add(tr,2*PI);
    }
    else if(tr>2*PI){
        add(0,tr-2*PI);add(tl,2*PI);
    }
    else{
        add(tl,tr);
    }
}
inline ll read(){
    ll x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while('0'<=c&&c<='9')x=x*10+c-'0',c=getchar();
    return x*w;
}
int main(){
    n=read();x0=read();y0=read();d=read();t=read();
    for(int i=1;i<=n;i++)x[i]=read(),y[i]=read();
    x[n+1]=x[1];y[n+1]=y[1];
    for(int i=1;i<=n;i++){
        solve(x[i],y[i]);
        if(x[i]==x[i+1]){
            for(int ty=min(y[i],y[i+1])+1;ty<max(y[i],y[i+1]);ty++)solve(x[i],ty);
        }
        else{
            double k=(y[i+1]-y[i])/(x[i+1]-x[i]);
            for(int tx=min(x[i],x[i+1])+1;tx<max(x[i],x[i+1]);tx++){
                double ty=y[i]+k*(tx-x[i]);solve(tx,ty);
            }
        }
    }
    double ans=0.0;
    int cnt=0;
    double a0=atan2(y0,x0);
    int w=t/(2*PI);double ls=t-2*PI*w;
    a[++num]=(node){a0,0};
    if(a0+ls>2*PI)a[++num]=(node){a0+ls-2*PI,0};
    else a[++num]=(node){a0+ls,0};
    sort(a+1,a+1+num);
    for(int i=1;i<=num;i++){
        if(cnt>0&&i>1){
            int cw=w;
            double cx=(a[i].x+a[i-1].x)/2.0;
            if(a0+ls<=2*PI){
                if(a0<=cx&&cx<=a0+ls)cw++;
            }
            else{
                if(cx>=a0||cx<=a0+ls-2*PI)cw++;
            }
            ans+=cw*(a[i].x-a[i-1].x);
        }
        cnt+=a[i].op;
    }
    printf("%.12f\n",ans);
    return 0;
}