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

package codejam3;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

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

    
    public static void main(String[] args) throws FileNotFoundException, IOException {

        String final_output="";
        FileReader input = new FileReader("Input.txt");
        BufferedReader bufRead = new BufferedReader(input);

        try{

            String line;
            line = bufRead.readLine();
            int testCases = Integer.parseInt(line);

            

            for (int i=0; i<testCases; i++)
            {
                //System.out.println("Case "+i);
                int pairs = 0;
                line = bufRead.readLine();
                String[] numbers = line.split(" ");

                Integer A = Integer.parseInt(numbers[0]);
                Integer B = Integer.parseInt(numbers[1]);

                for (int j=A; j<B; j++)
                {
                    String numA = Integer.toString(j);
                    for (int k=j+1; k<=B; k++)
                    {
                        String numB = Integer.toString(k);
                        for (int t=1; t<=numB.length(); t++)
                        {
                            //System.out.println("NumA:"+numA);
                            //System.out.println(numB);
                            String prefix = numB.substring(0, t);
                            //System.out.println(prefix);
                            String suffix = numB.substring(t, numB.length());
                            //System.out.println(suffix);
                            if ((suffix+prefix).equals(numA) && suffix.length()!=0){
                                pairs++; //System.out.println("pair!"); break;
                                //System.out.println(numA+" "+numB);
                            }
                        }
                    }
                }

                //System.out.println(pairs);
                final_output = final_output+"Case #"+(i+1)+": "+pairs+"\n";
            }

        }
        finally{}

        FileWriter output_file = new FileWriter("Output.txt");
        BufferedWriter bufWrite = new BufferedWriter(output_file);
        try{

            bufWrite.write(final_output);
        }
        finally{
            bufWrite.close();
        }

    }

}
