#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
using namespace std;
#define N 10010
struct node
{
double x,y;
}a[N];
bool cmp(node a,node b)
{
return a.x <b.x ;
}
int main()
{
int n,i;
double d;
int cs=0;
while(scanf("%d %lf",&n,&d)!=EOF)//n表示都少个岛,d表示雷达覆盖的半径
{
int flag=1;
int t,k;
if(n==0&&d==0)//结束标志
break;
for(i=0;i<n;i++)
{
scanf("%d %d",&t,&k);//输入岛的坐标
if(k>d)flag=0;//纵坐标>半径,标记下,应输出-1
if(flag)
{
a[i].x =t-sqrt(d*d-k*k);
a[i].y =t+sqrt(d*d-k*k);
}
}
printf("Case %d: ",++cs);
if(d<=0||!flag)
{
printf("-1\n");
continue;
}
if(n==1)
{
printf("1\n");
continue;
}
sort(a,a+n,cmp);
double ans=a[0].y;
int sum=1;
for(i=1;i<n;i++)
{
if(a[i].x >ans)
{
sum++;
ans=a[i].y ;
}
else
{
if(a[i].y
<ans)
ans=a[i].y ;
}
}
printf("%d\n",sum);
}
return 0;
}
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
using namespace std;
#define N
struct node
{
}a[N];
bool cmp(node a,node b)
{
}
int main()
{
}