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.util.*;

public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = scan.nextInt();
		
		for (int i = 0; i < cases; i++) {
			System.out.print("Case #" + (i + 1) + ": ");
			int bot = scan.nextInt();
			int top = scan.nextInt();
			int count = 0;
			
			for (int a = bot; a <= top; a++) {
				for (int b = a+1; b <= top; b++) {
					if (test(a, b)) count++;
				}
			}
			
			System.out.println(count);
		}
	}

	private static boolean test(int a, int b) {
		String numA = String.valueOf(a);
		String numB = String.valueOf(b);
		if (numA.length() != numB.length()) return false;
		
		char refA = numA.charAt(0);
		for (int i = 0; i < numA.length(); i++) {
			char currB = numB.charAt(i);
			if (currB == refA) {
				String compare = numB.substring(i) + numB.substring(0, i);
				if (compare.equals(numA)) return true;
			}
		}
		
		return false;
	}
}
