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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner scan = new Scanner(new File(""));
		BufferedWriter bw = new BufferedWriter(new FileWriter(""));
		
		int testCases = new Integer(scan.nextLine());
		Set<String> pairs = null;
		
		for(int i=0; i < testCases; i++){
			String[] nums = scan.nextLine().split(" ");
			int min = new Integer(nums[0]);
			int max = new Integer(nums[1]);
			pairs = new TreeSet<String>();
			
			int testNum = min;
			while(testNum <= max){
				getRecycled(testNum, pairs, min, max);
				++testNum;
			}
			bw.write("Case #"+(i+1)+": "+pairs.size()+"\n");
		}
		bw.flush();
		bw.close();
	}
	
	public static void getRecycled(int testNum, Set<String> pairs, int min, int max){
		int rec = 0;
		String number = Integer.toString(testNum);
		
		StringBuilder sb = new StringBuilder("");
		for(int i=1; i < number.length(); i++){
			sb.append(number.substring(i)).append(number.substring(0, i));
			try{
				rec = new Integer(sb.toString());
				if(testNum != rec && min <= rec && rec <= max && 
						!pairs.contains(testNum+"-"+rec) && !pairs.contains(rec+"-"+testNum)){
					pairs.add(testNum+"-"+rec);
				}
			} catch(NumberFormatException e){}
			sb.delete(0, sb.length());
		}
	}

}
