#include<iostream>
#include<complex>
#include<vector>
#include<cmath>
#include<cstdio>
using namespace std;
typedef complex<double> P;
typedef vector<P> G;
const double PI=acos(-1);
const double EPS=1e-8;
const double inf=1e8;
#define rep(i,a) for(int i=0;i<a;i++)
double dp[20][20][10010];
int main(){
  rep(i,20)rep(j,20)rep(k,10010)dp[i][j][k]=inf;
  int n;
  double x,y;
  cin>>n>>x>>y;
  y*=PI/180;
  G g(n);
  rep(i,n){
    int a,b;
    cin>>a>>b;
    g[i]=P(a,b);
  }
  double D[20][20]={0};
  double A[20][20]={0};
  rep(i,n)rep(j,n)A[i][j]=arg(g[i]-g[j]);
  rep(i,n)rep(j,n)D[i][j]=abs(g[i]-g[j]);
  dp[0][0][0]=0;
  rep(i,10010)rep(j,n)rep(k,n)if(i==0||j!=k){
    rep(l,n)if(l!=k){
      double dis=D[l][k];//abs(g[k]-g[l]);
      //if(i==0)printf("%.9f %.9f\n",x,dis+dp[j][k][l]);
      if(dis+dp[j][k][i]>x)continue;
      double q=A[k][j]-A[l][k];// arg(g[k]-g[j])-arg(g[l]-g[k]);
      if(q<0)q*=-1;
      while(q>PI)q=2*PI-q;//q-=PI;
      if(i==0){
	q=0;//abs(arg(g[l]-g[k]));
      }
      if(q>y)continue;
      dp[k][l][i+1]=min(dp[k][l][i+1],dp[j][k][i]+dis);
    }
  }
  int out=0;
  rep(i,n)rep(j,n)rep(k,10010)if(abs(dp[i][j][k]-inf)>EPS)out=max(out,k);
  cout<<out<<endl;
}