import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.*;
import java.util.ArrayList;
import java.util.List;

public class Problem_C {
    public static void main(String[] args) throws IOException
            {

                String fileName = "C-large.in";
                FileReader reader = new FileReader(fileName);
                LineNumberReader lnreader = new LineNumberReader(reader);
                FileWriter writer = new FileWriter("output-C-large.txt");
                PrintWriter out = new PrintWriter(writer);
                
                String line = ""; 
                line = lnreader.readLine();
                String line_array[];
                int A;
                int B;
                int length;
                int recycled;
                int count = 0;
				List<Integer> rec_list = new ArrayList<Integer>();
                int index = 0;

                while ((line = lnreader.readLine()) != null){
                    count = 0;
                    line_array = line.split(" ");
                    length = line_array[0].length();
					rec_list.clear();
                    A = Integer.parseInt(line_array[0]);
                    B = Integer.parseInt(line_array[1]);
                    for (int k=A;k<B;k++){
                        recycled = k;
						rec_list.clear();
                        for (int j=1;j<length;j++){
                            recycled = recycle(recycled,length);
                            if ((recycled > k) && (recycled <= B)){
                                if (!rec_list.contains(recycled)){
                                    count++;
                                    rec_list.add(recycled);
                                }
                            }
                        }
                    }

                    out.println("Case #" + (lnreader.
                    getLineNumber()-1) + ": " + count);
                }
                out.close();

            }

            private static  int recycle(int a,int length){
                int r = a%10;
                int q = a/10;
                r = r * (int)java.lang.Math.pow(10,length-1);
                return (r+q);
            }
}

