#include<bits/stdc++.h>
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
using namespace std;
#define INF 0x3f3f3f3f
#define endl '\n'
#define int long long
#define db long double
using pll = std::pair<int, int>;
const db phi = acos(-1.0);
struct P {
	db x, y;
	P() {}
	P(db _x, db _y) : x(_x), y(_y) {}
	P operator+(P p) { return {x + p.x, y + p.y}; }
	P operator-(P p) { return {x - p.x, y - p.y}; }
	P operator*(db d) { return {x * d, y * d}; }
	P operator/(db d) { return {x / d, y / d}; }
	db dot(P p) { return x * p.x + y * p.y; }
	db det(P p) { return x * p.y - y * p.x; }
	db distTo(P p) { return (*this-p).abs(); }
	db alpha() { return atan2(y, x); }
	db abs() { return sqrt(abs2());}
	db abs2() { return x * x + y * y; }
	P rot90() { return P(-y,x);}
	P unit() { return *this/abs(); }
	P rot(db an){ return {x*cos(an) - y*sin(an),x*sin(an) + y*cos(an)}; }
};
struct C
{
    P c;
    db r;
    P point(db a) {return P(c.x + cos(a) * r, c.y + sin(a) * r);}
};
void tp(P p, P o, db r, P& p1, P& p2) {
    db line = p.distTo(o);
    db ang = acos(r / line);
    P u, l;
    l = p - o;
    u.x = l.x / l.abs() * r;
    u.y = l.y / l.abs() * r;
    p1 = u.rot(-ang);
    p2 = u.rot(ang);
    p1 = p1 + o;
    p2 = p2 + o;
}
void solv(){
    int n;
    db d, t;
    C o;
    db x0, y0;
    cin >> n >> x0 >> y0 >> o.r >> t;
    o.c.x = o.c.y = 0;
    vector<P> e1,e2;
    for (int i = 1;i <= n;i++) {
        P t;
        cin >> t.x >> t.y;
        P p1, p2;
        tp(t, o.c, o.r, p1, p2);
        e2.push_back((t-p1)/(t-p1).abs());
        e1.push_back((t-p2)/(t-p2).abs2());
    }
    db tmp=-1;
    P ii, jj;
    for (P i : e1) {
        for (P j : e2) {
            db num = i.dot(j);
            if (tmp == -1) tmp = num, ii = i, jj = j;
            else if (tmp > num) tmp = num, ii = i, jj = j;
        }
    }
    db ans = 0;
    //cout << ii.x << " " << ii.y << endl;
    //cout << jj.x << " " << jj.y << endl;
    while (t >= 2.0 * phi) {
        t -= 2.0 * phi;
        ans = ans + acos(ii.dot(jj));
    }
    db a = ii.alpha(), b = jj.alpha();
    //cout << a << " " << b << endl;
    if (a > b) b = b + 2.0 * phi;
    //cout << a << " " << b << endl;
    // if (a > b) swap(a, b);
    db x = P(x0, y0).alpha();
    db y = y + t;
    ans = ans + max(min(y, b) - max(a, x), (db)0.0);
    a = a + 2.0 * phi;
    b = b + 2.0 * phi;
    ans = ans + max(min(y, b) - max(a, x), (db)0.0);
    a = a - 4.0 * phi;
    b = b - 4.0 * phi;
    ans = ans + max(min(y, b) - max(a, x), (db)0.0);
    cout << fixed << setprecision(16) << ans << endl;


}


signed main(){
//#ifdef LOCAL
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//#endif
    IOS;
    int T=1;
    //cin >> T;
    while (T--){
        solv();
    }
    return 0;
}