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;

public class Main {

    static final String FILE = "C-large";
    static final String INPUT = FILE + ".in";
    static final String OUTPUT = FILE + ".out";
    //

    public static void main(String[] args) throws FileNotFoundException, IOException {
        int T, A, B, x, y;

        PrintWriter pw;
        try (BufferedReader br = new BufferedReader(new FileReader(INPUT))) {
            pw = new PrintWriter(OUTPUT);

            T = Integer.parseInt(br.readLine());
            for (x = 1; x <= T; x++) {
                y = 0;

                //
                String[] temp = br.readLine().split(" ");
                A = Integer.parseInt(temp[0]);
                B = Integer.parseInt(temp[1]);

                //
                for (int i = A; i <= B; i++) {
                    String n = Integer.toString(i);
                    String m = new String(n);

                    ArrayList<String> result = new ArrayList<String>();
                    for (int j = 0; j < n.length() - 1; j++) {
                        m = m.charAt(m.length() - 1) + m;
                        m = m.substring(0, n.length());

                        if (!result.contains(m) && Integer.parseInt(n) < Integer.parseInt(m) && Integer.parseInt(m) <= B) {
                            y++;
                            result.add(m);
                        }
                    }
                }

                //
                System.out.println("Case #" + x + ": " + y);
                pw.println("Case #" + x + ": " + y);
            }
        }
        pw.close();
    }
}
