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 {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(); in.nextLine();		
		
		//for each test case
		for (int i = 1; i <= T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			
			int result = 0;
			
			for (int n = A; n <= B - 1; n++)
				for (int m = n + 1; m <= B; m++)
					if (isRecycledPair(n, m))
						result++;
			
			System.out.format("Case #%d: %d\n", i, result);
		}
	}
	
	private static boolean isRecycledPair(int n, int m) {
		
		String strN = "" + n;
		String strM = "" + m;
		
		int length = strN.length();
		
		for (int i = 0; i < length; i++)
		{
			boolean good = true;
			for (int j = 0; j < length; j++)
			{
				if (strN.charAt(j) != strM.charAt((i + j) % length))
				{
					good = false;
					break;
				}
			}
			if (good)
				return true;
		}
		
		return false;
	}
}