/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class RecycledNumber {

	/**
	 * @param args
	 * @throws IOException 
	 */

	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader in = new BufferedReader(new FileReader("./test3.txt"));
		FileWriter fstream = new FileWriter("./out3.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		
		String str,str2;
		
		int i = 0;
		int numTestCase = Integer.parseInt(in.readLine());
		
		while ((str = in.readLine()) != null) {
			str2="";
			int numOK = 0;
			String[] toks;
			toks = str.split(" ");
			int LB = Integer.parseInt(toks[0]);
			int UB = Integer.parseInt(toks[1]);
			int numDigit = toks[0].length();
			int []prev = new int[numDigit-1];
			if(numDigit >1){
				for(int k = LB; k < UB;k++)
				{
					for(int j = 1; j< numDigit; j++)
					{				
						String temp = Integer.toString(k);
						String temp1 = temp.substring(0,j);
						String temp2 = temp.substring(j,numDigit);
						String result = temp2+temp1;
						int res = Integer.parseInt(result);
						
						if(res > k && res <= UB)
						{
							numOK++;
							for(int l = 0;l<j;l++)
							{
								if(res == prev[l]) numOK--;
							}	
						}
						prev[j-1] = res;
					}
				}
			}
			str2 = "Case #" + (++i) + ": " + numOK + "\n";
			out.append(str2);
			System.out.print(str2);
		}
		in.close();
		out.close();
	}

}
