/*
 * 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.util.* ;

public class RecycledNumbers {
	 public static void main(String args[]) throws Exception
	 {
	
	String inFileName = "C:\\Documents and Settings\\kumarxnx.BKNG\\Desktop\\CodeJam\\3\\in"; 
	 String outFileName = "C:\\Documents and Settings\\kumarxnx.BKNG\\Desktop\\CodeJam\\3\\out";

	
	
	 
	 FileReaderWriter fri = new FileReaderWriter(inFileName,FileReaderWriter.READ_MODE) ; 
	 FileReaderWriter fro = new FileReaderWriter(outFileName,FileReaderWriter.WRITE_MODE) ;
	 
	 int inputs = fri.readInt() ;
	 ArrayList <Long> nums ;
	 HashMap map ;
	 long low  ;
	 long high ;
	 
	 for(long i=0 ; i<inputs ; i++)
	 {
		nums =fri.readLongList();
		map = new HashMap() ;
		low = nums.get(0) ;
		high = nums.get(1) ;
	    
		for(long j=low;j<=high;j++)
		{
			getCombination(map,j,low,high) ;	
		}
		
		fro.writeLine("Case #"+(i+1)+": "+map.size()) ;
		
	 }
	 
	 
	 fri.close() ; 
	 fro.close() ;
	 
	 }
	 
	 public static void getCombination(HashMap map , long num , long low , long high)
	 {
		 String str = ""+num ;
		 char [] arr = str.toCharArray() ;
		 int len = arr.length ;
		 
		 long newNum ; 
		 for(int i=1 ; i<=len ; i++)
		 {
			 arr  = shiftByOne(arr) ;
			 if(arr[0]!='0')
			 {
			 newNum = Long.parseLong(new String(arr)) ;
			 if(newNum!=num && newNum>=low && newNum<=high)
		 	    {
				   if ( !
						   ( 
						       map.containsKey(""+num+","+newNum)  || 
						       map.containsKey(""+newNum+","+num)					        
					      )
					   )   
				      {
					   
					   
					   map.put(""+num+","+newNum,null) ;
					   
					
				   }
		    	 }
			 }
		 }
	 }
	 
	 public static char[] shiftByOne(char[] arr) 
	 {
		char c = arr[arr.length - 1] ;
		char cnew [] = new char[arr.length] ;
		 		 
		for(int i=1;i<cnew.length ; i++)
		{
			cnew[i] = arr[i-1] ; 
		}
		cnew[0] = c ;
		return cnew ;
	 }
	 
	
}
