//题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=975
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 1000010
int sum1[maxn],sum2[maxn];
int main()
{
memset(sum1,0,sizeof(sum1));
memset(sum2,0,sizeof(sum2));
int a,b,cas=0;
for(int i=125;i<maxn;i++)
{
int num1=0,num2=0,num3=0;
char s[10];
int len=sprintf(s,"%d",i);
for(int j=0;j<len-2;j++)
{
if(s[j]=='5'&&s[j+1]=='2'&&s[j+2]=='1')
{
sum2[i]=sum2[i-1]+1;//类似dp的做法,利用前一位得到后一位
break;
}
else
sum2[i]=sum2[i-1];
}
for(int k=0;k<len;k++)
{
if(s[k]=='5')
num1++;
if(s[k]=='2')
num2++;
if(s[k]=='1')
num3++;
}
if(num1!=0&&num2!=0&&num3!=0)
sum1[i]=sum1[i-1]+1;
else
sum1[i]=sum1[i-1];
}
while(scanf("%d%d",&a,&b)!=EOF)
{
printf("Case %d:%d %d\n",++cas,sum1[b]-sum1[a-1],sum2[b]-sum2[a-1]);
}
return 0;
}