/*
 * 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.util.Scanner;

class ProbC{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int i=0;i<T;i++){
			//boolean flag[] = new boolean[2000001];
			int A, B;
			A = sc.nextInt();
			B = sc.nextInt();
			int count = 0;
			for(int j=A;j<=B;j++){
				//if(!flag[j]){	// kalo J blm crossed, check
					String check = j+"";
					int ndigit = check.length();
					boolean ada = false;
					int nomnom = 0;
					boolean flag[] = new boolean[2000001];
					for(int k=1;k<=ndigit-1;k++){
						if(check.charAt(check.length()-k) != '0'){
							int depan = Integer.parseInt(check.substring(0,check.length()-k));
							int belakang = Integer.parseInt(check.substring(check.length()-k));
							int hasil = (int)((Math.pow(10,ndigit-k)*belakang)+depan);
							//System.out.println("dari "+j+" hasil "+hasil);
							if(hasil != j && hasil >= A && hasil <= B){
//								System.out.println("Recycle "+hasil+" from "+j);
								if(j < hasil){
									//System.out.println("Recycle "+hasil+" "+j);
									if(!flag[hasil]){
										flag[hasil] = true;
										//ada = true;
										count++;
									}									
								}
							}
						}
					}
				//}
			}
			int kount = 0;
			/*for(int j=A;j<=B;j++){
				if(flag[j]){
					//System.out.println("recycle "+j);
					kount++;
				}
			}*/
			System.out.println("Case #"+(i+1)+": "+count);
		}
	}
}