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

}

package RecycledNumbers;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

	public static int numCase = 0;
	public static int A = 0;
	public static int B = 0;
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		
		process();		
	}
	
	public static void process() throws NumberFormatException, IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(
				new FileInputStream("RecycledNumbers.in")));
		numCase = Integer.parseInt(br.readLine());
		for (int i = 0; i < numCase; i++) {
			String str = br.readLine();
			String[] arr = str.split(" ");
			
			if (arr[0].length() == 1 && arr[1].length() == 1) {
				writeOut(i + 1, 0);
				continue;
			}

			A = Integer.valueOf(arr[0]);
			B = Integer.valueOf(arr[1]);
			
			if (B - A <= 5) {
				writeOut(i + 1, 0);
				continue;
			}
			
			process2(i + 1);
		}
	}
	
	public static void process2(int order) {
				
		//List<Integer> lstB = new ArrayList<Integer>();
		int count = 0;
		for (int n = A; n < B; n++) {
			if (isAllZero(n)) {
				continue;
			}
			for (int m = n + 1; m <= B; m++) {				
				if (!isAllZero(m) && isRecycledNumbers(n, m)) {
					count++;	
					//lstB.add(m);
				}
			}			
		}
		writeOut(order, count);
	}
	
	public static boolean isAllZero(int n) {
		
		int lengthN = String.valueOf(n).length();
		int dec = 1;
		for (int i = 0; i < lengthN - 1; i++) {
			dec *= 10;
		}
		if (n % dec == 0) {
			return true;
		}
		return false;
	}
	
	public static boolean isRecycledNumbers(int n, int m) {
		
		String strN = String.valueOf(n);
		String strM = String.valueOf(m);
		
		int lengthStrN = strN.length();
		for (int i = 1; i < lengthStrN; i++) {
			String prefix = strN.substring(lengthStrN - i, lengthStrN);
			if (!prefix.startsWith("0") && strM.startsWith(prefix)) {
				String t = prefix + strN.substring(0, lengthStrN - i); 
				if (t.equals(strM)) {						
					return true;
				}
			}
		}		
		return false;
	}
	
	public static void writeOut(int order, int result) {
		
		System.out.format("Case #%d: %d\n", order, result);
	}
}
