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;
import java.io.BufferedInputStream;
import java.util.HashSet;
public class C
{
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
		
		int n = scanner.nextInt();
		for (int i = 0; i < n; i++)
		{
			int count = 0;
			int low = scanner.nextInt();
			int high = scanner.nextInt();
			for (int j = low; j < high; j++)
			{
				String s = Integer.toString(j);
				String s2;
				int len = s.length();
				HashSet<Integer> set = new HashSet<Integer>();
				
				for (int k = 0; k < len-1; k++)
				{
					s2 = s.substring(len-k-1, len) + s.substring(0, len-k-1);
					int num = Integer.parseInt(s2);
					//System.out.println(num);
					if (num >= low && num <= high && num > j && !set.contains(num))
					{
						count++;
						set.add(num);
					}
				}
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
}
