package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.*;
import java.util.Scanner;

public class Problem3 {
    public static void main(String[] args) {
        try {
            Scanner inputReader = new Scanner(new File("S:\\input.in"));
            int inputCases = inputReader.nextInt();
            PrintWriter outputWriter = new PrintWriter("S:\\output.in");
            for (int currentInputCase = 0; currentInputCase < inputCases; currentInputCase++) {
                String markUpString = "";
                int milestone = 0;
                int firstA = inputReader.nextInt();
                int secondB = inputReader.nextInt();
                for (int currentN = firstA; currentN < secondB; currentN++) {
                    String n = currentN + "";
                    for (int i = 1; i <= n.length() - 1; i++) {
                        String trimString = n.substring(n.length() - i, n.length()) + n.substring(0, n.length() - i);
                        if (!trimString.startsWith("0")) {
                            if (!n.equals(trimString)) {
                                int trimmedInt = Integer.parseInt(trimString);
                                if (trimmedInt <= secondB && trimmedInt > (Integer.parseInt(n))) {
                                    if (!markUpString.contains(n + "#" + trimString)) {
                                        markUpString += (n + "#" + trimString + ",");
                                        milestone++;
                                    }
                                }
                            }
                        }
                    }
                }
                outputWriter.write("Case #" + (currentInputCase + 1) + ": " + milestone + "\n");
            }
            outputWriter.flush();
            outputWriter.close();
        } catch (Exception e) {

        }
    }

}
