import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.*;
import java.util.*;
class Q3
{
    public static void main(String str[])throws IOException
    {
 //       long time1=System.currentTimeMillis();
//        FileReader fr=new FileReader("C-small-attempt0.in");
        FileReader fr=new FileReader("C-large.in");
        BufferedReader br=new BufferedReader(fr);
        FileWriter fw=new FileWriter("output.txt");
        BufferedWriter bw=new BufferedWriter(fw);
        PrintWriter pw=new PrintWriter(bw);
        int T=Integer.parseInt(br.readLine());
        for(int i=1;i<=T;i++)
        {
            StringTokenizer st=new StringTokenizer(br.readLine());
            String A=st.nextToken();
            String B=st.nextToken();
            int l=A.length();
            int a=Integer.parseInt(A);
            int b=Integer.parseInt(B);
            int num=0;
//            int check[][]=new int[288][2];
//            int loop=0;
            for(int j=a;j<=b;j++)
            {
                String tmp=""+j;
                int cc[]=new int[B.length()];
                int index=0;
                for(int k=l-1;k>=1;k--)
                {
                    String tmp1=tmp.substring(k)+tmp.substring(0,k);
                    if(tmp1.charAt(0)=='0')
                    continue;
                    int t1=Integer.parseInt(tmp1);
                    if(t1>j && t1>=a && t1<=b)
                    {
                        int flag=0;
                        for(int kk=0;kk<index;kk++)
                        {
                            if(cc[kk]==t1)
                            flag=1;
                        }
                        if(flag==1)
                        continue;
                        cc[index++]=t1;
                        num++;
                    }
                }
            }
            pw.println("Case #"+i+": "+num);
  /*          for(int i1=0;i1<288;i1++)
        {
            for(int j=i1+1;j<288;j++)
            {
                if(check[j][0]==check[i1][0] && check[j][1]==check[i1][1])
                System.out.println(i1+"......................"+j+"................"+check[j][0]+".................."+check[j][1]);
            }
        }  */
        }
        
        pw.close();
        bw.close();
        fw.close();
        br.close();
        fr.close();
//        System.out.println(System.currentTimeMillis()-time1);
    }
}