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


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try
		{
			Scanner scanner = new Scanner(new File("./data/inRecycled"));
			PrintWriter writer = new PrintWriter(new File("./data/outRecycled"));
			int t = scanner.nextInt();
			scanner.nextLine();
			for(int i = 0; i < t; i++) {
				int a = scanner.nextInt();
				int b = scanner.nextInt();
				
				int res = 0;
				
				String check = "" + a;
				if(check.length() != 1)
				{
					
					for(int j = a; j <= b; j++){
						
						if(check.length() == 2)
						{
							String temp = "" + j;
							String other1 = temp.charAt(1) + "" + temp.charAt(0);
							int ot = Integer.valueOf(other1);
							if( ot <= b && j < ot){
								res++;
							}
						}
						else if(check.length() == 3)
						{
							String temp = "" + j;
							String other1 = "" + temp.charAt(2) + temp.charAt(0) + temp.charAt(1);
							String other2 = "" + temp.charAt(1) + temp.charAt(2) + temp.charAt(0);
							
							int ot1 = Integer.valueOf(other1);
							int ot2 = Integer.valueOf(other2);
							
							if ( ot1 <= b && j < ot1) {
								res++;
							}
							if ( ot2 <= b && j < ot2) {
								res++;
							}
						}
					}
				}
				writer.println("Case #" + (i+1) + ": " + res);

			}
			writer.close();
			scanner.close();
			
		}catch(Exception e) {e.printStackTrace();}
	}

}
