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.Scanner;

public class C {

	static boolean iftrue(int n, int m) {
		String aa = n + "";

		if (n == m)
			return false;

		for (int i = 1; i < aa.length(); i++) {
			String ll = aa.substring(i, aa.length());
			String bb = aa.substring(0, i);

			String ss = ll + bb;
			if (ss.equals(m + "") && m > n) {
				return true;
			}
		}

		return false;
	}

	public static void main(String[] args) {

		//System.out.println(iftrue(12, 31));
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {

			int A = in.nextInt();
			int B = in.nextInt();

			int res = 0;

			for (int k = A; k <= B; k++) {
				for (int l = k + 1; l <= B; l++) {
					if (iftrue(k, l))
						res++;
				}
			}
			System.out.format("Case #%d: %s\n", i + 1, res);
		}
	}
}
