/*
 * 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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class RecycledNumbers {

	public static int outputLine(String inputLine){
		int count = 0;
		String[] inputArray = inputLine.split(" ");
		ArrayList line = new ArrayList(Arrays.asList(inputArray));
		int min = Integer.parseInt((String) line.get(0));
		int max = Integer.parseInt((String) line.get(1));
		
		
		for (int k = min; k <= max; k++) {
			
			for (int j = min; j <= max; j++) {
				int numbDigits = String.valueOf(min).length();
				for (int x = 0; x <numbDigits; x++) {
					if ((String.valueOf(j).substring(numbDigits - (x+1), numbDigits) + String.valueOf(j).substring(0,numbDigits - (x+1))).equals(String.valueOf(k))) {
						if (k < j) {
						count++;
						}
					}
				}
			}
		}
			
		return  count;
	}
	
	
	public static void main (String [] args) {
		ArrayList answers = new ArrayList();
		System.out.println("Insert a number.");
		int i;
		Scanner scan = new Scanner(System.in);
		i = Integer.parseInt(scan.nextLine());
		
		for (int j = 0; j< i; j++) {
			String inputLine = scan.nextLine();
			answers.add(outputLine(inputLine));
			}
		
		for (int j = 0; j < answers.size(); j++){
			System.out.println("Case #" + (j+1) + ": " + (answers.get(j)));
		}
	}		
}
