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


public class ProblemB {

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new FileReader("C-small-attempt0.in"));
		System.setOut(new PrintStream("salida"));

//		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String linea = bf.readLine();
		int casos = Integer.parseInt(linea);
		int cont = 1;
		while(casos>0){
			linea = bf.readLine();
			String[] nums = linea.split(" ");
			int result = 0;
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			
			for (int i = a; i <=b; i++) {
				int actual = i;
				ArrayList<Integer> transpuestos = trasponer(actual);
				result+=generarParejas(actual, b,transpuestos);
			}
			System.out.println("Case #"+cont+": "+result);
			cont++;
			casos--;
		}
	}


	private static int generarParejas(int actual, int b, ArrayList<Integer> lista) {
		int cont = 0;
		for (int i = actual+1; i <=b; i++) {
			if(lista.contains(i))
				cont++;
		}
		return cont;
	}


	private static ArrayList<Integer> trasponer(int actual) {
		String ini = actual+"";
		ArrayList<Integer> resp = new ArrayList<Integer>();
		for (int i = 0; i < ini.length()-1; i++) {
			String s = ini.substring(ini.length()-1-i)+ini.substring(0,ini.length()-1-i);
			resp.add(Integer.parseInt(s));
		}
		return resp;
	}
}