/*
 * 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.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Arrays;


public class Recycled {


	public static void main(String args[]) throws IOException
	{
		try
		{
			PrintWriter wt= new PrintWriter("C:\\Documents and Settings\\windows\\workspace\\test\\src\\file.out.txt");
			Scanner I = new Scanner(new File("C:\\Documents and Settings\\windows\\workspace\\test\\src\\C-small-attempt0.in"));
			String num = I.nextLine();
			int numTests = Integer.parseInt(num);

			for(int x=0; x<numTests; x++)
			{
				int a = I.nextInt();
				int b = I.nextInt();
				int count = 0;
				int arr[] = new int[b-a+1];

				for(int z = 0; z<(b-a+1); z++)
				{  arr[z] = a + z;
				;
				}

				for( int i = 0; i < (b-a+1); i++)
				{
					for(int j = i; j < (b-a+1); j++)
					{
						if( (arr[i] < arr[j]) && (i != j))
						{
							if (isRecycled(arr[i],arr[j])== true)
								count = count + 1;	 

						} 	
					}
				}
				//logic to write result to file
				String finalResult = "Case #"+(x+1)+": "+count;
				wt.println(finalResult);
			}
			wt.close();
			I.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}

		catch(IOException e)
		{
			System.out.println(e);
		}
	}


	// Replacement algorithm
	public static boolean isRecycled(int a, int b)
	{  
		//also need to check for size of a and b ?? not needed if we directly compare


		String strA = Integer.toString(a);
		String strB = Integer.toString(b);
		String newStr = null;
		for (int i = 0; i<strB.length(); i++)
		{   
		    newStr = movedFirstToLast(strB);
		    strB = newStr;
			if(strA.equals(newStr))
			{
				return true;
			}
		}		  	
		return false;

	} 


	public static String movedFirstToLast(String a)
	{
		String newString = null;
		String firstChar = a.substring(0,1);
		newString = a.substring(1); // except first character
		newString = newString + firstChar;
        return newString;
	}


}		 

