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


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int numTestCases = Integer.valueOf(scanner.nextLine());
		for ( int i =0; i < numTestCases; i++ ) {
			String theCase = scanner.nextLine();
			//Error checking not necessary for now.

			Scanner lineScanner = new Scanner(theCase);
			int A = lineScanner.nextInt();
			int B = lineScanner.nextInt();
			int numDigits = getNumDigits(A,B);
			int[] powersOf10 = new int[numDigits];
			powersOf10[0] =1;
			for ( int j =1; j < numDigits; j++) {
				powersOf10[j] = powersOf10[j-1]*10;
			}
			//Brute force
			int count=0;
			for ( int number = A; number <=B; number ++ ) {
				int[] acceptedPairs = new int[numDigits]; // Defaults to 0
				for ( int firstDigit = 1; firstDigit < numDigits; firstDigit++ ) {
					//Make a new number.
					int newNum = (number%powersOf10[firstDigit])*powersOf10[numDigits-firstDigit] + number/powersOf10[firstDigit];
					if ( newNum > B || newNum <= number) {
						continue;
					}
					for ( int j=0; j < acceptedPairs.length; j++) {
						if ( acceptedPairs[j] == newNum ) {
							//Duplicate number
							break;
						} else if ( acceptedPairs[j] == 0 ) {
							//New number
							acceptedPairs[j] = newNum;
							break;
						}
					}
				}
				// Count non-zero accepted pairs
				for ( int j = 0; j < acceptedPairs.length; j++ ) {
					if ( acceptedPairs[j] == 0 ) {
						break;
					}
					count++;
				}
			}
			StringBuilder builder = new StringBuilder("Case #");
			builder.append(i+1).append(": ");
			builder.append(count);
			System.out.println(builder.toString());
		}
	}

	private static int getNumDigits(int a, int b) {
		int count = 0;
		while ( a > 0) {
			count++;
			a /= 10;
		}
		return count;
	}

}
