#include <bits/stdc++.h>
using namespace std;

typedef complex<double> P;

int n;
double r, t;
P p[20];
bool c[20][20][20];
double d[20][20];
double dp[10010][20][20];

int main()
{
	cin >> n >> r >> t;
	t = t / 180.0 * acos(-1.0);
	for (int i = 0; i < n; i++){
		double x, y;
		cin >> x >> y;
		p[i] = P(x, y);
	}
	
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			for (int k = 0; k < n; k++){
				if (i == j) continue;
				if (j == k) continue;
				if (k == i) continue;
				double a = abs(arg((p[j] - p[i]) / (p[k] - p[j])));
				if (a <= t){
					c[i][j][k] = true;
				}
			}
		}
	}

	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			d[i][j] = abs(p[i] - p[j]);
		}
	}

	fill_n(**dp, 10010 * 20 * 20, 99999.9);
	for (int i = 1; i < n; i++){
		dp[1][0][i] = d[0][i];
	}

	int res = 0;
	for (int i = 1; i < 10005; i++){
		for (int j = 0; j < n; j++){
			for (int k = 0; k < n; k++){
				if (dp[i][j][k] <= r) res = i;
				for (int l = 0; l < n; l++){
					if (!c[j][k][l]) continue;
					dp[i + 1][k][l] = min(dp[i + 1][k][l], dp[i][j][k] + d[k][l]);
					dp[i + 1][k][l] = min(dp[i + 1][k][l], 99999.9);
				}
			}
		}
	}
	
	cout << res << endl;
}