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

public class ProblemC {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		int a = 0, b = 0, count;
		String a_str = "";
		ArrayList<String> ar = new ArrayList<String>();
		for (int i = 0; i < t; i++) {
			ar.clear();
			count = 0;
			a = in.nextInt();
			b = in.nextInt();
			a_str = Integer.toString(a);
			int a_length = a_str.length();
			if (a_length > 1) {
				for (int j = a; j < b; j++) {
					for (int k = j + 1; k <= b; k++) {
						a_str = Integer.toString(j);
						//b_str = Integer.toString(k);
						for (int h = 0; h < a_length - 1; h++) {
							a_str = a_str.charAt(a_length - 1) + a_str.substring(0, a_length - 1);
							if (Integer.parseInt(a_str) == k && !ar.contains(j + ", " + k)) {
								count++;
								ar.add(j + ", " + k);
								//System.out.println(j + ", " + k);
							}
						}
					}
				}
				System.out.println("Case #" + (i + 1) + ": " + count);
			} else {
				System.out.println("Case #" + (i + 1) + ": 0");
			}
		}
	}
}
