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


public class Recycled {

	public static String shift(String x){
		return (x.substring(x.length() - 1) + x.substring(0, x.length() - 1));
	}
	
	public static void main(String[] args) {
		
		int t, x = 1;
		String a, b, s;
		Scanner scan = new Scanner(System.in);
		
		t = scan.nextInt();
		
		for(int i=0; i<t; i++){
			
			a = scan.next();
			b = scan.next();
			
			ArrayList<String> al = new ArrayList<String>();
			
			int n = Integer.parseInt(a);
			
			while(n <= Integer.parseInt(b)){
				
				s = "" + n;
				String orig = ""+n;
				
				for(int j=0; j<a.length() - 1; j++){
					
					s = shift(s);
					if(s.equals(orig)) break;
					
					//System.out.println(s);
					
					if(Integer.parseInt(s) >= Integer.parseInt(orig) && Integer.parseInt(s) <= Integer.parseInt(b) && !al.contains(s)){
						al.add(orig+"-"+s);
					}
				}
				
				n++;
			}
			
	//		for(int j=0; j<al.size(); j++)
	//			System.out.println(al.get(j));
			
			System.out.println("Case #" + x + ": " + al.size());
			x++;
		}
		
	}

}
