/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.*;
import java.util.*;
import java.lang.Math.*;
public class gcj3
{
     public static void main(String args[])throws Exception
     {
         //Scanner in=new Scanner(System.in);
         //BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         //BufferedReader br = new BufferedReader(new FileReader("gcj3.in"));
         //PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("gcj3.out")));
         //PrintWriter pw = new PrintWriter(System.out);
         StringTokenizer st;
         BufferedReader br = new BufferedReader(new FileReader("C:\\Users\\rahul\\Desktop\\gcj3.in"));
         PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("C:\\Users\\rahul\\Desktop\\gcj3.out")));
         int t=Integer.parseInt(br.readLine());
         int ctr=0;
         while(t>0)
         {
             int total=0;
             t--;ctr++;
             st=new StringTokenizer(br.readLine());
             int A=Integer.parseInt(st.nextToken());
             int B=Integer.parseInt(st.nextToken());
             int i,j,k,l;
             int ctr1=0,ctr2=0;
             for(i=A;i<=B;i++)
             {
                 String s=Integer.toString(i);
                 l=s.length();
                 String s1=s;
                 int a[]=new int[l+1];
                 a[0]=-1;
                 for(j=0;j<l;j++)
                 {
                     s1=s1.substring(l-1)+s1.substring(0,l-1);
                     int val=Integer.parseInt(s1);
                     a[j+1]=val;
                 }
                 Arrays.sort(a);
                 for(j=1;j<=l;j++)
                 if(a[j]<=B && a[j]>i && a[j]!=a[j-1])
                     {
                         ctr1++;
                     }
                }
             pw.println("Case #"+ctr+": "+ctr1);   
            }
            pw.flush();
     }
     
}