/*
 * 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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

	
	int A;
	int B;
	int count = 0;
	List pairs = new ArrayList<String>();
	
	public static void main(String[] args) {
		
		int T;
		
		BufferedReader bf;
		try {
			bf = new BufferedReader(new FileReader("C-small-attempt1.in"));
			T = Integer.parseInt(bf.readLine().trim());
			
			for (int i = 0; i <= T -1 ; i++) {
				
				RecycledNumbers rn = new RecycledNumbers();
				String[] line = bf.readLine().split(" ");
				rn.A = Integer.parseInt(line[0]);
				rn.B = Integer.parseInt(line[1]);
				rn.count = 0;
				
				rn.resolve();
				
				rn.printOut(i + 1);
				
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
		
	}

	private void printOut(int i) {
		
		System.out.println("Case #" + i + ": " + count);
	}

	private void resolve() {
		int min = A;
		int minLength;
		if(min < 12){
			min = 12;
		}
		
		while (min <= B){
			String minS = String.valueOf(min); 
			String start = "";
			String end = "";
			minLength = minS.length();
			for (int i = 0; i < minLength -1; i++) {
				start = minS.substring(0,i +1 );
				end = minS.substring(i +1);
				if ( checkNewPair(minS, start,end)){
					count += 1;
				}
			}
			min += 1;
		}
	}

	private boolean checkNewPair(String minS, String start, String end) {
		if (end.charAt(0) == '0'){
			return false;
		}
		
		int newNumber = Integer.parseInt(end + start);
		
		if (newNumber > B ){
			return false;
		}
		
		int min = Integer.parseInt(minS);
		
		String newPair = "";
		if (min < newNumber){
			newPair = minS +"," + newNumber;
		}else if(min > newNumber){
			return false;
		}else if (min == newNumber){
			return false;
		}
			
		if ( pairs.contains(newPair)){
			return false;
		}
		pairs.add(newPair);
		return true;
	}

}


