1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <stack>
 7 #include <queue>
 8 #include <cmath>
 9 #include <map>
10 #define ll  __int64
11 #define dazhi 2147483647
12 #define bug() printf("!!!!!!!")
13 #define M 200005
14 using namespace  std;
15 int t;
16 ll l,r;
17 ll bit[20];
18 ll dp[100][15];
19 ll functi(int pos ,int flag,int m)
20 {
21     if(pos==0) return (m==0);
22     if(flag&&dp[pos][m]!=-1) return dp[pos][m];
23     ll x=flag?9:bit[pos];
24     ll ans=0;
25     for(ll i=0;i<=x;i++)
26         ans+=functi(pos-1,flag||i<x,(m+i)%10);
27     if(flag) dp[pos][m]=ans;
28     return ans;
29 }
30 ll fun(ll num)
31 {
32     int len=0;
33     memset(bit,0,sizeof(bit));
34     while(num)
35     {
36         bit[++len]=num%10;
37         num/=10;
38     }
39     return functi(len,0,0);
40 }
41 int main()
42 {
43     while(scanf("%d",&t)!=EOF)
44     {
45         memset(dp,-1,sizeof(dp));
46          for(int i=1;i<=t;i++)
47          {
48              scanf("%I64d %I64d",&l,&r);
49              printf("Case #%d: %I64d\n",i,fun(r)-fun(l-1));
50          }
51     }
52     return 0;
53 }