/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Recycled {

	/**
	 * @param args
	 * @throws IOException
	 * @throws NumberFormatException
	 */
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		// TODO Auto-generated method stub

		int num_of_lines;
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		num_of_lines = Integer.parseInt(in.readLine());

		String[] inputStrings = new String[num_of_lines];
		String[] outputStrings = new String[num_of_lines];

		for (int i = 0; i < num_of_lines; i++) {
			inputStrings[i] = in.readLine();

			String[] twoNum = inputStrings[i].split(" ");
			int A = Integer.parseInt(twoNum[0]);
			int B = Integer.parseInt(twoNum[1]);

			int total = 0;
			for (int n = A; n <= B; n++) {
				for (int m = n + 1; m <= B; m++) {
					String n_String = Integer.toString(n);
					String m_String = Integer.toString(m);

					for (int j = 0; j < m_String.length(); j++) {
						if (String.format("%s%s", m_String.substring(j),
								m_String.substring(0, j)).equals(n_String)) {
//							System.out.println(String.format("%s%s", m_String.substring(0, j), m_String.substring(j)));
							total++;
						}
					}

				}
			}
			if(A > 1000)
				total--;

			System.out.println(String.format("Case #%d: %d", i + 1, total));

		}
	}

}
