
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}

import java.io.*;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author RockHead
 */
public class Recycle {
    
     public static void main(String args[]) throws FileNotFoundException, IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("C:\\Users\\RockHead\\Desktop\\C-small-attempt0.in"));
        BufferedWriter writer = new BufferedWriter(new FileWriter("C:\\Users\\RockHead\\Desktop\\Recycle_Sol.txt"));
        int testNo = Integer.parseInt(reader.readLine());
        int count=0;
        for(int i=1;i<=testNo;i++)
        {
            String str=reader.readLine();                
            String[] info=str.split(" ");
            
            int A=Integer.parseInt(info[0]);
            int B=Integer.parseInt(info[1]);
            
            int n=A;
           for(int j=n;j<B;j++)
           {
              int m=j+1;
               for(int k=m;k<=B;k++)
               {
                  // System.out.println("Recycle (" + j +" "+ k  +") "+ isRecycled(Integer.toString(j),Integer.toString(k)));
                   if(isRecycled(Integer.toString(j),Integer.toString(k)))
                    count++;
               }
           } 
            System.out.println("Case #"+ i+": "+count );
            writer.write("Case #"+ i+": "+count);
            writer.newLine();
            count=0;
            
        }
        
        
        reader.close();
        writer.close();
}
     
     
     public static boolean isRecycled(String a,String b)
     {
        //move from the back of a to the front 
         for(int i=a.length();i>0;i--)
         {
             String subOne=a.substring(i);
             String subTwo=a.substring(0,i);
             String newString=subOne+subTwo;
             if(newString.equals(b))
                return true;
         }
         
         return false;
     }
     }
