/*
 * 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.*;
public class googleJam3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		BufferedReader reader = null;
		PrintWriter writer = null;
		try{
			reader = new BufferedReader(new FileReader("C-small-attempt0.in"));
			writer = new PrintWriter(new BufferedWriter(new FileWriter("C-small-attempt0.out")));
			int numInputs = Integer.parseInt(reader.readLine());
			for(int i = 0; i < numInputs; i++)
			{
				String temp = reader.readLine();
				int index = temp.indexOf(" ");
				int A = Integer.parseInt(temp.substring(0, index));
				temp = temp.substring(index+1);
				int B = Integer.parseInt(temp);
				int numWinners = 0;
				for(int j = A; j < B; j++)
				{
					for(int k = j+1; k <= B; k++)
					{
						String original = (new Integer(j)).toString();
						String start = "";
						start += original;
						String goal = (new Integer(k)).toString();
						do{
							String tempString = "";
							tempString += start;
							start = tempString.substring(start.length()-1);
							start+= tempString.substring(0,tempString.length()-1);
							if(start.equals(goal))
								numWinners++;
						} 
						while(!start.equals(original));
						
					}
				}
				writer.print("Case #" + (i+1) + ": " + numWinners + "\n");
				
			}
			writer.close();
		}
		catch(Exception e)
		{
			throw(e);
		}
	}

}
