/*
 * 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 A {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T,no1,no2,k=0;
		A obj=new A();	
		T=sc.nextInt();
		int cnt=0;
		while(T>0)
		{	cnt++;
			no1=sc.nextInt();
			no2=sc.nextInt();
			k=0;
			for(int i=no1;i<=no2;i++)
			{
				for(int j=no1;j<=no2;j++)
				{
						if(i!=j)
						{
							k+=obj.chk(i,j);
							
							
						}
					
				}
				
			}
			System.out.println("Case #"+cnt+": "+k/2);
			T--;
		}
	}
	char ip1[]=new char[10];
	char ip2[]=new char[10];
	int length1(int n)
	{int i=0;
		while(n>0)
		{
			n=n/10;
			i++;
		}
		return i;
	}
	public int chk(int a,int b)
	{
		int l1,tn=1;
		l1=length1(a);
		
		
		//System.out.println("n1:"+a+" n2:"+b);

		for(int i=1;i<l1;i++)
		{int at=a,at2,at1;
		tn=1;
			for(int j=1;j<=i;j++)
			{
				tn*=10;
			}
				at1=at%tn;
				//System.out.println("at:"+at1);
				at2=at/tn;
				
				//System.out.println("at:"+at2);
				tn=1;
				for(int j=1;j<=length1(at2);j++)
				{
					tn*=10;
				}	
			int atmp=at1*tn+at2;
			//System.out.println("atmp:"+atmp);

			if(atmp==b)
				return 1;
			
		}
		return 0;
	}


}
