/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(new File("C-small-attempt0.in"));
		FileWriter out = new FileWriter("out.txt");

		int lineNumber = input.nextInt();
		for (int i = 0; i < lineNumber; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			int count = 0;
			int div = 1;
			for (int j = a; j < b; j++) {
				for (int k = j + 1; k <= b; k++) {
					div = 1;
					int length = 0;
					while (j / div > 0) {
						length++;
						div *= 10;
					}
					int max = div;
					div = 10;
					if (j == 334 && k == 433)
						System.out.println(length+" "+max);
					for (int velicina = 0; velicina < length; velicina++) {
						if (j == 334 && k == 433) {
							System.out.println("---------");
							System.out.println(j % div + "	" + k / (max / div));
							System.out.println(k % (max / div) + "	" + j / (div));
						}
						if (j % div == k / (max / div)
								&& k % (max / div) == j / div) {
							count++;
							break;
						}
						div*=10;
					}

				}
			}
			String solution = "Case #" + (i + 1) + ": " + count;
			solution += System.getProperty("line.separator");
			out.write(solution);

		}
		out.close();
		input.close();
	}
}
