#include<iostream>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
int n,d,cnt=0,ns=-1,jj=0;
struct island{
  double x;
  double y;       
};
struct range{
  double min;
  double max;       
};

int main(){
    int k=1;
  while(cin>>n>>d){
  cnt=0;
  
  if(n==0&&d==0) return 0;
  int i=0,p=0;
  bool ivsit[100];
  memset(ivsit,false,sizeof ivsit/sizeof ivsit[0]);
  island xy[100];
  range xrang[100];
  while(i<n){
     cin>>xy[i].x>>xy[i].y;
     ++i;
  }
     for( i=0;i<n;++i){
        if(xy[i].y>d){ p=1;cout<<"Case "<<k<<": "<<ns<<endl;}        
     }  
     for( i=0;i<n;++i){
        double tem=pow(d*1.0,2)-pow((xy[i].y)*1.0,2);
        double l=sqrt(tem); 
         xrang[i].min=xy[i].x-l;
         xrang[i].max=xy[i].x+l;       
     } 
     for( i=0;i<n;++i){
             if(ivsit[i]) continue;
             ivsit[0]=true;
        for(int j=i+1;j<n;++j){
               if(ivsit[j]) continue; 
            if((xrang[i].min<=xrang[j].max&&
            xrang[i].max>=xrang[j].min)&&j<n)
                ivsit[j]=true;       
        } 
          
        ++cnt;
     } 
   if(p!=1&&n!=0) cout<<"Case "<<k<<": "<<cnt<<endl;
   if(p!=1&&n==0) cout<<"Case "<<k<<": "<<jj<<endl;
   ++k;
 } 
          return 0;
    
}