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


public class RecyledNumbers {
	public static void main(String args[]) throws IOException{
	   	 Scanner scan=new Scanner(new File("C-small-attempt0.in"));
	   	 PrintWriter pw=new PrintWriter(new File("result.txt"));
	   	 int caseNum=Integer.parseInt(scan.nextLine());
	   	 for(int i=1;i<=caseNum;i++){
	   		 String a=scan.nextLine();
	   		 //System.out.println(a);
	   		 int result=0;
	   		 String[] temp=new String[2];
	   		 temp=parseString(a);
	   		 //System.out.println(temp);
	   		 String A=temp[0];
	   		 String B=temp[1];
	   		 for(int j=Integer.parseInt(A);j<Integer.parseInt(B);j++){
	   			 String t=""+j;
	   			 result=result+judgeRecycle(t,B);
	   		 }
	   		 pw.println("Case #"+i+": "+result);
	   		 System.out.println("Case #"+i+": "+result);
	   	 }
	   	 pw.flush();
	   	 pw.close();
	    }
		
		public static String[] parseString(String s){
			String[] result=new String[2];
			for(int i=0;i<s.length();i++){
				if(s.charAt(i)==' ') {
					result[0]=s.substring(0, i);
					//System.out.println(result[0]);
					result[1]=s.substring(i+1, s.length());
					//System.out.println(result[1]);
					break;
				}
				if(i==s.length()-1) result[0]=s;
				result[1]=s.substring(i, s.length());
			}
			//System.out.println(result);
			return result;
		}
		
		public static int judgeRecycle(String toBeJudged, String B){
			
			List<Integer> movedNum=new ArrayList<Integer>();
			for(int i=1;i<toBeJudged.length();i++){
				int temp=Integer.parseInt(toBeJudged.substring(i, toBeJudged.length())+toBeJudged.substring(0, i));
				if(temp>Integer.parseInt(toBeJudged) && temp<=Integer.parseInt(B)) {
					if(!movedNum.contains(temp)) movedNum.add(temp);
					System.out.println(toBeJudged+" "+temp);
				}
			}
			return movedNum.size();
		}
}
