/*
 * 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;

//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  a.java
//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  a <test.in >test.out
public class C {

	public static String meth1 (String s){
		String res = "";
		res=res+s;
		
	return res;	  
	}
	//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  A.java
	//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  A <test.in >test.out
	 static Scanner sc = new Scanner(System.in);
	 public static void main(String[] args) {
	  int cases  ;
	  int res;
	 int m=0;
	   
	  String tmp;
	
	  cases =  Integer.parseInt(sc.nextLine());  
	  int A,B;
	  String buff;
	  for(int id = 1; id <= cases; id++){
		  res=0;
		  buff="";
		   A = sc.nextInt();
		   B = sc.nextInt();sc.nextLine();
			  for (int i = A;i<=B;i++){
				tmp = i+"";
				for(int j =1;j<tmp.length();j++){
		 m = Integer.parseInt(tmp.substring(j,tmp.length() )+tmp.substring(0, j));
		
			if (m>i&&m<=B)
				if(!buff.contains( tmp+"#"+m)){
					res++;
					buff+= tmp+"#"+m+")(";
				}
				}

			  }
		  
		  
		  System.out.printf("Case #%d: %d%n", id, res);
	 
	  }
	 }
}