/*
 * 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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Scanner;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		//System.setOut(new PrintStream(new File("RecycledNumbers.txt")));
	
		Scanner scanner = new Scanner(System.in);
		int testcasenum = Integer.valueOf(scanner.next());
		scanner.nextLine();
		for (int testcase = 0; testcase < testcasenum; testcase++) {
			System.out.print("Case #");
			System.out.print(testcase+1);
			System.out.print(": ");
			int from = scanner.nextInt();
			int to = scanner.nextInt();
			int count = 0;
			boolean table[] = new boolean[to+1];
			for (int num = from; num <= to; num++) {
				if (!table[num]){
					int len = String.valueOf(num).length();
			
					int shift = num;
					table[num] = true;
					int pair = 1;
					for (int i = 0;i < len-1;i++){
						shift = shiftLeft(shift, len);
						if (shift >= from && shift <= to&& !table[shift]){
							pair++;
							table[shift] = true;
							
						}
					}
					count += pair*(pair-1)/2;
				}
			}
			System.out.println(count);

		}
	}


	public static int shiftLeft(int num, int len) {
		int digit = num % 10;
		num = num / 10;
		return num += Math.pow(10, len-1)*digit;	
	}
	
	
	public static int getUniqueDigits(int num){
		boolean digits[] = new boolean[10];
		while (num != 0) {
			int digit = (num % 10);
			digits[digit] = true;
			num = num / 10;
		}
		int count = 0;
		for (int i = 0;i < 10;i++){
			count += digits[i]?1:0;
		}
		return count;
	}
	

}
