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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class CodeJam2012C
{
	public static void main(String [] args) throws FileNotFoundException
	{
		new CodeJam2012C().go();
	}
	
	public void go() throws FileNotFoundException
	{
		PrintWriter writer = new PrintWriter(new File("output.txt"));
		Scanner in = new Scanner(new File("C-small-attempt0.in"));
//		Scanner in = new Scanner(System.in);
		int iterations = in.nextInt();
		for (int i = 0; i < iterations; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int counter = 0;
			for (int j = 0; j < (B - A); j++)
			{
				String s = (j + A) + "";
				for (int k = 0; k < s.length() - 1; k++)
				{
					s = s.substring(1) + s.charAt(0);
					int temp = Integer.parseInt(s);
					if (temp <= B && (j + A) < temp)
						counter++;
				}
			}
//			System.out.println("Case #" + (i + 1) + ": " + counter);
			writer.write("Case #" + (i + 1) + ": " + counter + "\n");
		}
		writer.flush();
		writer.close();
	}
}
