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;

public class Recycled
{
	public static void main(String[] args)
	{
		int T = StdIn.readInt();

		for(int tr = 1; tr <= T; tr++)
		{
			int A = StdIn.readInt();
			int B = StdIn.readInt();

			//total num of recycled
			int num = 0;

			for (int i = A; i <= B; i++)
			{
				//converts to string
				String temp = Integer.toString(i);

				//list of recycled numbers given m = i
				ArrayList<Integer> reNum = new ArrayList<Integer>();

				//for each shift
				for(int ind = 1; ind < temp.length(); ind++)
				{
					String first = temp.substring(0,ind);
					String last = temp.substring(ind);

					String shift = last + first;
					int shiftNum = Integer.parseInt(shift);

					if (shiftNum <= i || shiftNum > B)
						continue;

					if (reNum.indexOf(shiftNum) < 0)
					{
						reNum.add(shiftNum);
					}
				}

				num += reNum.size();
			}

			StdOut.println("Case #" + tr + ": " + num);
		}
	}
}
