/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			BufferedReader bf=null;
			try {
				int T;
				bf = new BufferedReader(new FileReader("src/com/codejam/input/C-small-attempt0.in"));
				T = Integer.parseInt(bf.readLine());
				for(int i=0;i<T;i++){
					String line = bf.readLine();
					String[] numbers = line.split(" ");
					int A = Integer.parseInt(numbers[0]);
					int B = Integer.parseInt(numbers[1]);
					int seq = A;
					int count=0;
					
					while(seq<B){
						count += checkRecycle(String.valueOf(seq), numbers[0], numbers[1]);
						seq++;
					}
					
					System.out.println("Case #"+(i+1)+": "+count);
					
				}
				
			} catch (FileNotFoundException e) {
				
				e.printStackTrace();
			} finally{
				bf.close();
			}
	
			
		}catch(IOException e){
			e.printStackTrace();
		}

	}
	
	public static int checkRecycle(String N,String min,String max){
	
		int mNum,nNum,maxNum;
		Set<String> uniqueNum = new HashSet<String>();
		
		for(int i=N.length()-1;i>0;i--){
			if( Character.getNumericValue(N.charAt(i)) > Character.getNumericValue(max.charAt(0)) ) continue;
			
			String M;
			M=N.substring(0, i);
			M=N.substring(i,N.length())+M;
		    mNum = Integer.parseInt(M);
			nNum = Integer.parseInt(N);
			maxNum = Integer.parseInt(max);
			if(mNum>nNum && mNum<=maxNum){
				uniqueNum.add(M);
			}
		}
		
		return uniqueNum.size();
	}

}
