/*
 * 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.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class RecycleNumber {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(".in")));
		int num =0;
		String line = null;
		line = br.readLine();
		int i=0;
		num = Integer.parseInt(line);
		
		while(num-->0){
			int result = 0;
			line = br.readLine();
			i++;
			String[] nums = line.split(" ");
			int min = Integer.parseInt(nums[0]);
			int max = Integer.parseInt(nums[1]);
			
			for(int t=min;t<=max;t++){
				result += countRecyles(t,min,max);
			}
			
			System.out.println("Case #"+i+": "+result/2);
			
		}
		br.close();
	}
	
	public static int countRecyles(int num,int min,int max){
		int count = 0;
		Set<Integer> result = getNums(num);
		for(int i:result){
			if(i>=min&&i<=max){
				count++;
			//	System.out.println(num+","+i);
			}
			
		}
		
		return count;
	}
	
	public static Set<Integer> getNums(int num){
		Set<Integer> list = new HashSet<Integer>();
		
		StringBuilder sb = new StringBuilder(num+"");
		for(int i=0;i<sb.length();i++){
			char last = sb.charAt(sb.length()-1);
			sb.deleteCharAt(sb.length()-1);
			sb.insert(0, last);
			if(last!='0'){
				int tmp = Integer.parseInt(sb.toString());
				if(tmp != num)
					list.add(tmp);
			}
		}
		
		return list;
	}
	

}
