https://vjudge.net/contest/279730#problem/C
#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
int kk,f,i,n,m,x,y,j,ans;
double k;
pair<double,double>a[100000];
int main()
{
while (scanf("%d%d",&n,&m)){
if (n==0&&m==0) break;
kk++;
f=0;
printf("Case %d: ",kk);
for (i=1; i<=n; i++)
{
scanf("%d%d",&x,&y);
k=sqrt(m*m-y*y);
if (y>m)
f=1;
a[i]=make_pair(x-k,x+k);
}
if (f==1) {printf("-1\n");continue;}
ans=0;
sort(a+1,a+n+1);
k=-10000000000;
for (i=1;i<=n;i++)
if (k+0.0000001<=a[i].first) {
ans++;
k=a[i].second;
}else k=min(a[i].second,k);
printf("%d\n",ans);
}
}