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


//Recycle
public class Main
{
	public static void main(String[] args)
	{
		Main main = new Main();
		main.run();
		
		//main.checkRecycle(123, 233);
	}
	
	
	public void run()
	{
		
		Scanner input = new Scanner(System.in); 
		
		int cases = input.nextInt();
		
		
		for(int i = 0; i < cases; i++)
		{
			int a  = input.nextInt();
			int b  = input.nextInt();
			
			//countRecycle(a,b);
			
			System.out.println("Case #" + (i+1) + ": " + countRecycle(a,b));
		}
		
		
	}
	
	public int countRecycle(int a, int b)
	{
		int count = 0;
		
		for(int i = a; i < b; i++)
		{
			int []alist = new int[10];
			//get the count of the digits in a
			String inum = Integer.toString(i);
			for(int w = 0; w < inum.length(); w++)
			{
				alist[Integer.parseInt(inum.substring(w,w+1))]++;
			}
			
			for(int j = i+1; j <= b; j++)
			{
				
				int []blist = new int[10];
				inum = Integer.toString(j);
				for(int x = 0; x < inum.length(); x++)
				{
					blist[Integer.parseInt(inum.substring(x,x+1))]++;
				}
				
				if(Arrays.equals(alist, blist) && checkRecycle(i,j))
				{
					//System.out.println(i + " " + j);
					count++;
				}
				
			}
			
		}
		
		return count;
	}
	
	public boolean checkRecycle(int a, int b)
	{
		String anum = Integer.toString(a);
		String bnum = Integer.toString(b);
		
		
		for(int i = 0; i < anum.length() - 1;i++)
		{
			//System.out.println(anum + " " +anum.substring(i+1, anum.length()) + "|" + anum.substring(0, i+1));
			if(bnum.equals(anum.substring(i+1, anum.length()) + anum.substring(0, i+1)))
				return true;
			
		}
		
		
		return false;
	}
	
	
}
