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


public final class problem2 {

	//private Hashtable<String, String> recode = new Hashtable<String, String>();
	
	public static String decode(int min, int max){
		int total = 0;
		for(int i = min ; i <= max ; i++){
			
			String n = Integer.toString(i);
			int len = n.length();
			n = n.concat(n);
			//System.out.println(len + " " + n);
			
			for(int j = 1 ; j < len ; j++){
				//System.out.print(n.substring(j, j+len) + " ");
				String tmp = n.substring(j, j+len);
				//System.out.print(tmp + " ");
				
				if(tmp.charAt(0) != '0'){
					int m = Integer.valueOf(tmp);
					
					if(m > i && m <= max){
						//System.out.println(i + " " + m);
						total++;
					}
				}
				
			}
			//System.out.println();
			
			
		}
		return Integer.toString(total);
	}


	
	public static void main(String[] args){

		try{
			Scanner sc = new Scanner(new File("C-small-attempt0.in"));
			FileWriter fw = new FileWriter("final.txt");
		
		
			String tmp = sc.nextLine();
			int step = Integer.valueOf(tmp);
		
			int counter = 1;
			while(sc.hasNextLine()){
				//System.out.print("Case #" + counter + ": "); 
				
				String s = sc.nextLine();
				Scanner ssc = new Scanner(s);
				int A = ssc.nextInt();
				int B = ssc.nextInt();
				
				
				//System.out.println(A + " " + B); 
				String xx = decode(A, B);
				System.out.println("Case #" + counter + ": " + xx);
				fw.write("Case #" + counter + ": " + xx);
				fw.write("\n");
				counter++;
				if(step < counter)
					break;
			}
			fw.close();
		}catch(Exception e){}
		
	}
	
}