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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Scanner;

public class C {
	public static HashMap<Integer, ArrayList<Integer>> recycledNumbers = new HashMap<Integer, ArrayList<Integer>>( );

	public ArrayList<Integer> getRecycledNumbers( Integer n, Integer a, Integer b ) {
		if ( n < 10 || ( n < 100 && n % 10 == 0 ) )
			return null;

		ArrayList<Integer> aList = recycledNumbers.get( n );
		if ( aList == null ) {
			aList = new ArrayList<Integer>( );
			
			String s = n.toString( );
			int len = s.length( );
			for ( int i = 1; i < len; i++ ){
				Integer m = new Integer( s.substring( len-i ) + s.substring( 0, len-i) );
				if ( m > n && m.toString( ).length( ) == s.length( ) ) {
					if ( !aList.contains( m ) ) {
						aList.add( m );
					}
				}
			}
			recycledNumbers.put( n, aList );
		}
		return filterRecycledNumbers( aList, a, b );
	}
	
	public ArrayList filterRecycledNumbers( ArrayList<Integer> list, Integer a, Integer b ) {
		ArrayList<Integer> retList = new ArrayList<Integer>( );
		Iterator<Integer> iterator =list.iterator( );
		while ( iterator.hasNext( ) ) {
			Integer i = iterator.next( );
			if ( ( a <= i && i <= b ) ) {
				retList.add( i );
			}
		}
		return retList;
	}

	public void solve( Scanner sc, PrintWriter pw ) {
		int tests = sc.nextInt( ); sc.nextLine( );
		for ( int i = 0 ; i < tests; i++ ) {
			int a = sc.nextInt( );
			int b = sc.nextInt( );

			ArrayList<Integer> recycledNumbers = new ArrayList<Integer>( );
			for ( int j = a; j <= b; j++ ) {
				ArrayList<Integer> lst = getRecycledNumbers( j, a, b );
				if ( lst != null && lst.size( ) > 0 ) {
					recycledNumbers.addAll( lst );
				}
			}
			
			pw.print( "Case #" + (i+1) + ": " + recycledNumbers.size( ) );
			pw.println( );
			pw.flush( );
		}
	}

	public static void main ( String[] args ) throws IOException {
		Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt0.out"));
		new C( ).solve( sc, pw );
		pw.close( );
		sc.close( );
	}
}