// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const double eps = 1e-6;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

using Point = complex<double>;

const size_t MAX_N = 20;
const size_t MAX_P = MAX_N * MAX_N;
const size_t MAX_C = 1e4 + 10;
const size_t SIZE = MAX_C * (MAX_P + 2);
const double inf = 5e15;
double dists[SIZE];
Point ps[MAX_N];
double d_arr[MAX_N][MAX_N];
ll can_go[MAX_P];
double last_d[SIZE];

struct Dist {
    Dist() {
        fill(dists, dists + SIZE, inf);
        fill(last_d, last_d + SIZE, -1);
    }

    ll make_id(ll from, ll to, ll c) {
        return c * MAX_P + from * MAX_N + to;
    }

    double get(ll from, ll to, ll c) {
        return dists[make_id(from, to, c)];
    }

    void set(ll from, ll to, ll c, double d) {
        dists[make_id(from, to, c)] = d;
    }
};

using PN = pair<double, ll>;

int main() {
    ll N;
    cin >> N;
    double r, th;
    cin >> r >> th;
    th /= 360;
    th *= 2 * pi;
    for (ll i = 0; i < N; i++) {
        double x, y;
        cin >> x >> y;
        ps[i] = Point(x, y);
    }

    for (ll i = 0; i < N; i++) for (ll j = i + 1; j < N; j++) {
        double dx = ps[i].real() - ps[j].real();
        double dy = ps[i].imag() - ps[j].imag();
        double d = sqrt(dx * dx + dy * dy);
        d_arr[i][j] = d_arr[j][i] = d;
    }

    for (ll i = 0; i < MAX_P; i++) {
        ll f = i / MAX_N;
        ll t = i % MAX_N;
        if (!(f < N && t < N)) continue;
        for (ll j = 0; j < N; j++) {
            if (i == j) continue;
            Point p1 = ps[t] - ps[f];
            Point p2 = ps[j] - ps[t];
            double diff = abs(arg(p1) - arg(p2));
            diff = min(diff, (double)(2 * pi - diff));
            if (diff <= th) can_go[i] |= (1 << j);
        }
    }

    Dist dist;
    priority_queue<PN, V<PN>, greater<PN>> pq;
    
    for (ll i = 1; i < N; i++) {
        double d = d_arr[0][i];
        if (r < d) continue;
        dist.set(0, i, 1, d);
        pq.emplace(d, dist.make_id(0, i, 1));
    }

    while (pq.size()) {
        ll from, to, p, cal, id;
        double d;
        {
            ll tmp;
            tie(d, tmp) = pq.top();
            pq.pop();
            cal = tmp / MAX_P;
            p = tmp % MAX_P;
            from = p / MAX_N;
            to = p % MAX_N;
            id = dist.make_id(from, to, cal);
            if (dist.get(from, to, cal) < d) continue;
            if (last_d[tmp] == d) continue;
            last_d[tmp] = d;
        }

        // cout << from << ", " << to << ", " << cal << ", " << d << endl << flush;
        for (ll nxt = 0; nxt < N; nxt++) {
            if (nxt == from || nxt == to) continue;
            if (!(can_go[p] & (1 << nxt))) continue;
            double nd = d + d_arr[to][nxt];
            if (r < nd) continue;
            if (dist.get(to, nxt, cal + 1) < nd) continue;
            dist.set(to, nxt, cal + 1, nd);
            pq.emplace(nd, dist.make_id(to, nxt, cal + 1));
        }
    }

    ll ans = 0;
    for (ll i = 0; i < N; i++) for (ll j = 0; j < N; j++) for (ll k = 0; k < MAX_C; k++) {
        double d = dist.get(i, j, k);
        if (r < d) continue;
        chmax(ans, k);
    }

    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 66468