#include<cstring>

 #include<cstdio>

 #include<algorithm>

 #include<iostream>

 #include<cmath>

 #include<queue>

 #include<map>

 #define N 2007

 #define pi acos(-1)

 #define inf 1000000007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

     while(isdigit(ch)){x=(x<<)+(x<<)+ch-'';ch=getchar();}

     return x*f;

 }

 int n,tot,st[N];

 double r;

 struct Node

 {

     double l,r;

     Node()

     {

         l=r=;

     }

     friend bool operator<(Node x,Node y)

     {

         return x.l<y.l;

     }

 }a[N];

 int getlis(int x)

 {

     st[tot=]=x,a[].r=-inf;

     for (int i=x+;i<=n&&a[i].l<a[x].r;i++)

         if (a[i].r>a[st[tot]].r) st[++tot]=i;

         else

         {

             int l=,r=tot,ans=tot;

             while(l<=r)

             {

                 int mid=(l+r)>>;

                 if (a[st[mid]].r>=a[i].r) ans=min(mid,ans),r=mid-;

                 else l=mid+;

             }

             if (ans==) continue;

             if (a[i].r<a[st[ans]].r) st[ans]=i;

         }

     return tot;

 }

 double get_dis(double x,double y)

 {

     return sqrt(x*x+y*y);

 }

 int main()

 {

     n=read(),r=read();

     for (int i=;i<=n;i++)

     {

         double x=read(),y=read();

         if (get_dis(x,y)<r){i--,n--;continue;}

         a[i].l=atan2(y,x)-acos(r/get_dis(x,y));

         a[i].r=atan2(y,x)+acos(r/get_dis(x,y));

         if (a[i].r>pi) a[i].r-=*pi,swap(a[i].l,a[i].r);

         if (a[i].l<-pi) a[i].l+=*pi,swap(a[i].l,a[i].r);

     }

     sort(a+,a+n+);

     int ans=;

     for (int i=;i<=n;i++)

         ans=max(ans,getlis(i));

     printf("%d\n",ans);

 }