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;
import java.util.Arrays;

public class RecycleNums {

    public static void main(String[] args) throws FileNotFoundException {
		File input = new File(args[0]);
        Scanner scan = new Scanner(input);
		PrintStream output = new PrintStream(new File("C-small.out"));
		
		int cases = scan.nextInt();
		
		for (int i = 0; i < cases; i++) {
			int first = scan.nextInt();
			int second = scan.nextInt();
			int result = checkRange(first, second);
			output.print("Case #" + (i + 1) + ": " + result);
			if (i != cases - 1) output.println();
		} // for
		
    } // main

	public static int checkRange(int min, int max) {
		int count = 0;
		
		for (int i = min; i < max; i++) {
			for (int j = i + 1; j <= max; j++) {
				if (isRecycleNums(i, j)) count++;
			} // for
		} // for
		
		return count;
		
	} // checkRange
	
	public static boolean isRecycleNums(int a, int b) {
		char[] first = Integer.toString(a).toCharArray();
		char[] second = Integer.toString(b).toCharArray();
		
		if (first.equals(second)) return true;
		
		for (int i = 0; i < first.length; i++) {
			rotateArray(first);
			if (Arrays.equals(first, second)) return true;
		} // for
		
		return false;
		
	} // isRecycleNums
	
	public static void rotateArray(char[] myChars) {
		char first = myChars[0];
		for (int i = 0; i < myChars.length - 1; i++) {
			myChars[i] = myChars[i+1];
		} // for
		myChars[myChars.length - 1] = first;
	} // rotateArray

} // RecycleNums