/*
 * 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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.TreeSet;

public class C_Recylce
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File("./data/C-small-attempt0.in")));
		long casos = Integer.parseInt(br.readLine());

		for (long caso = 1; caso <= casos; caso++)
		{
			String[] datos = br.readLine().split(" +");
			int A = Integer.parseInt(datos[0]);
			int B = Integer.parseInt(datos[1]);
			int pairs = 0;
			TreeSet lstPairs = new TreeSet<String>();

			if (A >= 10)
			{
				for (int i = A; i <= B; i++)
				{
					String original = Integer.toString(i);
					// System.out.print(original + " : ");
					for (int j = 1; j < original.length(); j++)
					{
						String corrido = original.substring(j) + original.substring(0, j);
						int test = Integer.parseInt(corrido);
						if (test <= B && test > i)
						{
							// System.out.print(corrido + " ");
							pairs++;
							String pareja = original + "-" + corrido;
							lstPairs.add(pareja);
						}
					}
					// System.out.println("");
				}
			}

			System.out.println("Case #" + caso + ": " + lstPairs.size());
		}

		br.close();
	}
}
