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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

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