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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.LinkedList;

/**
 *
 * @author Marisol
 */
public class clsArchivo{
   
    private LinkedList<String> lista=new   LinkedList<String>();
    
    public  void clsArchivo(String src) {
        try {
            File file=new File(src);
            FileReader filereader = new FileReader(file);  
            BufferedReader buffer = new BufferedReader(filereader);
            String linea=buffer.readLine();
            
            lista.add(linea);
            while ((linea=buffer.readLine())!=null) {
                lista.add(linea);
            }   
        } catch (Exception e) {
            System.out.println("archivo incorrecto"); 
        }
    }
    
    public  LinkedList<Integer> progra (){
        String total = lista.get(0);//el primer elemento
        
        //Creamos un arreglo con los datos leidos
        LinkedList array = new LinkedList<Integer>();
        
        for (int i = 1; i < Integer.parseInt(total)+1; i++) {
            String linea=lista.get(i);//lectura de lineas
            String num[] = linea.split("\\s+");
            int res=0;
            int numero1 = Integer.parseInt(num[0]);
            int numero2 = Integer.parseInt(num[1]);
            
            for (int j = numero1; j < numero2; j++) {
                for (int k = j+1; k < numero2+1; k++) {
                    String uno = ""+j;
                    String dos = ""+k;
                    String pal1="";
                    if(uno.length() == dos.length()){
                        for (int l = 0; l < uno.length(); l++) {
                            String pal2= ""+uno.charAt(l);
                            if(dos.contains(pal1+pal2)==true){
                                pal1+=pal2;
                            }
                            else{
                                l=uno.length();
                            }
                        }
                        String pal4="";
                        for (int l = pal1.length(); l < dos.length(); l++) {
                            String pal3= ""+uno.charAt(l);
                            if(dos.contains(pal4+pal3)==true){
                                pal4+=pal3;
                            }
                            else{
                                l=dos.length();
                            }
                        }
                        String res1 =pal4+pal1;
                        
                        if(dos.equals(res1)==true){
                            //System.out.println(" "+ res1+ "  " +dos);
                            res++;
                        }
                    }
                }
            }
                        
            System.out.println("Case #"+ (i) +": "+res);
            array.add(res);
        }
        return array;
    }
    
}