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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.lang.Integer;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new BufferedReader(new FileReader("input.in")));
		int x = new Integer(in.nextLine());
		HashSet<Integer> visited = new HashSet<Integer>();
		for (int xi = 1; xi <= x; xi++) {
			String[] token = in.nextLine().split(" ");
			int min = Integer.parseInt(token[0]);
			int max = Integer.parseInt(token[1]);
			int count = 0;
			for (int i = min; i <= max; i++) {
				String s = Integer.toString(i);

				for (int j = 0; j < Integer.toString(min).length(); j++) {
					Integer recycle = Integer.parseInt(s.substring(j)
							+ s.substring(0, j));
					if (!visited.contains(recycle))
						if (recycle < i && recycle >= min && recycle <= max)
							count++;
					visited.add(recycle);
				}
				visited.clear();
			}
			System.out.print("Case #" + xi + ": ");
			System.out.println(count);
		}

	}
}