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 RN {
	
	static int A,B;
	static int[] chuso = new int[11];
	static int result = 0;
	public static void RN(int n, int B)
	{
		String ns = Integer.toString(n);
		int nl = ns.length();
		for (int i = 1; i < nl; i++)
		{
			String tmp = ns.substring(i);
			String tmp1 = ns.substring(0, i);
			String new_num = tmp + tmp1;
			int m = Integer.parseInt(new_num);
			if (m > n && m <= B)
				{
					//System.out.println(m + " " + n);
					result ++;
				}
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int k = 0; k<T; k++)
		{
		A = sc.nextInt();
		B = sc.nextInt();
		result = 0;
		for (int i = A; i<=B; i++)
			RN(i,B);
		//RN(12);
		System.out.println("Case #" + (k+1) + ": " + result);
	
		}
	}

}
