/*
 * 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;
        } 
    
}


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

/**
 *
 * @author vhd
 */
import java.io.*;
import java.util.*;
import java.math.*;
public class NewClass {
    public static void main(String vhd[]) throws Exception
    {
       
      

      
     // FileInputStream fis = new FileInputStream ("jam.txt");
     // FileOutputStream out=new FileOutputStream("outt.txt");
     
        RandomAccessFile file = new RandomAccessFile("jam.txt", "rw");
        RandomAccessFile file1 = new RandomAccessFile("outt.txt", "rw");
        String t = file.readLine();
        int times= Integer.parseInt(t);

        
        
        for( int r= 1 ; r<= times ; r++)
        {
     
            StringTokenizer st= new StringTokenizer(file.readLine()); 
       
        int num1 = Integer.parseInt(st.nextToken());
        int num2=   Integer.parseInt(st.nextToken());
        
      char ch ;
      int count =0;
      //fis.read();
      Scanner sc = new Scanner (System.in);
      
      
      int main1 = num1;
      
      int main2= num2;
      int mid = (num1 + num2 )/2;
      int n,m;
     String s1 = (Integer.valueOf(num1)).toString();
     String s2 = (Integer.valueOf(num2)).toString();
    
     int temp;
     int len1 = s1.length();
     int len2 = s2.length();
     int k =0,l =0;
     int arr[] = new int[100];
  
     
      for( int i = num1 ; i< num2 ; i++)
      {
          while(k<len1)
             {
                 n= i%10;
                 m= i/10;
                 arr[k]=n* (int)Math.pow(10.0, len1-1) +m;

                
                      
                 i= arr[k++];

             } k=0;
         temp= 0;
         while(k<len1)
         {
            if(i != arr[k] && arr[k]>i && arr[k]<=num2 )
              {
                  
                  count++;
              } k++;
         }
         k=0;
          
      }
     
file1.write(("Case #"+r+": " +count+ "\n").getBytes());
               
        }
    }
}