/*
 * 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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class RecycledPairs {
	public static void main(String []args) throws NumberFormatException, IOException{
		BufferedReader in = new BufferedReader(new FileReader("input.in"));
		String hm="", line[];
		int n =Integer.valueOf(in.readLine()), m=1, a, b, c;
		for(m=1;m<=n;m++){
			System.out.print(m+" ");
			line=in.readLine().split(" ");
			a=Integer.valueOf(line[0]); b=Integer.valueOf(line[1]);
			c=0;
			for(int i=a;i<b;i++){
				for(int j=i+1;j<=b;j++){
					//System.out.println("ANA: "+i+" "+j);
					if(recycled(String.valueOf(i),String.valueOf(j))) c++;
				}
			}
			hm+="Case #"+m+": "+c+"\n";
		}
		System.out.println();
		System.out.println(hm);
	}

	private static boolean recycled(String n, String m) {
		String aux=""; int li=0;
		int leng=n.length();
		//System.out.println("Length: "+leng);
		if(leng==1) return false;
		for(int i=leng-1;i>0;i--){
			aux=String.valueOf(n.charAt(leng-1));
			aux+=n.substring(0, leng-1);
			n=aux;
			//System.out.println(aux+" "+m);
			if(n.equals(m))
				return true;
		}
		return false;
	}
}
