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


package Test1;


import java.io.BufferedReader;
import java.io.InputStreamReader;




public class Test1 {

	public static void main(String[] args) {

	String temp1 = null;
	String temp2 = null;
	int n,a,b; 
	
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in)) ;
    try {
    	
    	String str = in.readLine();
    	int result;
    	n = Integer.parseInt(str.trim());
    	for (int i = 1; i <= n; i++) {
    		str = in.readLine();
    		String[] temp = str.split(" ");
    		a = Integer.parseInt(temp[0]);
    		b = Integer.parseInt(temp[1]);
    		result = 0;
    		for (int j=a; j<=b;j++){
    			temp1 = (new Integer(j)).toString();
    			for (int k=1; k<temp1.length(); k++) {

    				String newtemp = temp1.substring(k)+temp1.substring(0, k);
    				int currentnum = Integer.parseInt(newtemp);
    				if (currentnum <= j) continue;
    				temp2 = (new Integer(currentnum)).toString();
    				if (temp2.length() != newtemp.length()) continue;
    				if (currentnum < a || currentnum > b) continue;
    				//System.out.println("Case #"+i+": "+j+":"+currentnum+";;;;;;;"+temp1.substring(0, k)+"====="+temp1.substring(k));
    				result++;
    			    
    			}
    			
    		}
    		System.out.println("Case #"+i+": "+result);
    		//System.out.println("");
    	}
    } catch (Exception e) {
    	
    }
	}
}

