/*
 * 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.awt.List;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class ProblemC {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File(args[0]));
		int numberOfLines = Integer.parseInt(sc.nextLine());
		Scanner lineScan;
		int lowerBound, upperBound;
		String line;
		String number;
		String movingPart;
		String newNumber;
		int count;
		
		for (int i = 0; i< numberOfLines; i++)
		{
			line = sc.nextLine();
			lineScan = new Scanner(line);
			lowerBound = lineScan.nextInt();
			upperBound = lineScan.nextInt();
			count = 0;
			
			if (upperBound < 10)
			{
				System.out.println("Case #" + (i+1) + ": " + 0);
			}
			else
			{
				for (int j = lowerBound; j<= upperBound; j++)
				{
					number = Integer.toString(j);

					for (int k = 1; k< number.length(); k++)
					{
						if (number.charAt(k) != '0')
						{
							movingPart = number.substring(k, number.length());

							newNumber = movingPart + number.substring(0,k);

							if (Integer.parseInt(newNumber) <= upperBound && 
									Integer.parseInt(newNumber) > Integer.parseInt(number))
							{
								count ++;
								//System.out.println("Number " + number + " New number " + newNumber + "counter" + count);
							}
						}
					}


				}

				System.out.printf("Case #%d: %d\n",(i+1), count);

			}
		}
	}
}
