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

public class test3
{

	public static void main(String[] args) throws Exception
	{
		new test3().run();
	}

	PrintWriter out = null;

	int getCount(int d, int max)
	{
		String s = Integer.toString(d);
		int n = s.length();

		HashSet<Integer> hs = new HashSet<Integer>();
		for (int i = 1; i < n; i++)
		{
			StringBuffer sb = new StringBuffer();
			sb.append(s.substring(n - i, n));
			sb.append(s.substring(0, n - i));

			int b = Integer.parseInt(sb.toString());

			if (b > d && b <= max)
				hs.add(b);
		}

		return hs.size();
	}

	void run() throws Exception
	{
		Scanner in = new Scanner(System.in);
		out = new PrintWriter(new FileWriter("codejam.txt"));

		int T = in.nextInt();
		for (int i = 0; i < T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int total = 0;
			for (int j = A; j <= B; j++)
				total += getCount(j, B);

			out.printf("Case #%d: %d\n", i + 1, total);
		}
		out.close();
	}
}
