
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;
	}
	

}

package gcj;
 
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Mervin.Lavin
 */
public class Gcj
{

    public static void main
        (String[] args)
        throws Exception
    {
        doProb3( "C-small-attempt1.in", "output.txt" );
    }
    
    private static void doProb3
        ( String inputFileName, String outputFileName )
        throws Exception
    {
        File inputFile = new File( inputFileName );
        Scanner scanner = null;
        scanner = new Scanner( inputFile );
        File outputFile = new File( outputFileName );
        BufferedWriter output = new BufferedWriter( new FileWriter( outputFile ) );
        
        int a, b, otherPairs;
        HashMap<Integer,Integer> distinctPairs;
        int testCases = scanner.nextInt();
        for ( int caseNum = 1; caseNum <= testCases; caseNum++ )
        {
          a = scanner.nextInt();
          b = scanner.nextInt();
          distinctPairs = new HashMap<Integer,Integer>();
          otherPairs = 0;
          for ( int n = a; n < b; n++ )
          {
              String stringN = Integer.toString(n);
              if ( stringN.length() == 1 )
              {
                  continue;
              }
              for ( int index = 1; index < stringN.length(); index++ )
              {
                  String stringM = 
                      stringN.substring( index, stringN.length() ) 
                      + stringN.substring( 0, index );
                  int m = Integer.parseInt( stringM );
                  if ( ( !stringN.equals( stringM ) )
                      && ( n < m ) && ( m <= b ) )
                  {
                      if ( distinctPairs.containsKey( n ) && !distinctPairs.containsValue( m ) )
                      {
                          otherPairs++;
                      }
                      else 
                      {
                          distinctPairs.put( n, m );
                      }
                  }
              }
          }
          output.append( "Case #" + caseNum + ": " +  ( distinctPairs.size() + otherPairs ) );
          output.newLine();
        }
        scanner.close();
        output.close();
    }
}
