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.*;
import java.util.*;

public class RecycledNumbersSmall {
	public static void main(String[] args) {
		try {
			FileWriter output = new FileWriter(new File("output.txt"));
			Scanner s = new Scanner(new File("input.txt"));
			int trials = s.nextInt();
			s.nextLine();
			for (int i = 0; i < trials; i++) {
				int count = 0;
				int start = s.nextInt();
				int end = s.nextInt();
				for (int b = end; b >= start; b--) {
					String numWord = b + "";
					ArrayList<Integer> added = new ArrayList<Integer>();
					for (int z = numWord.length() - 1; z >= 1; z--) {
						if (numWord.charAt(z) != '0') {
							int x = Integer
									.parseInt(numWord.substring(z,
											numWord.length())
											+ numWord.substring(0, z));
							if (x < b && x >= start && !added.contains(x)) {
								added.add(x);
								count++;
							}
						}
					}
				}
				output.write("Case #" + (i + 1) + ": ");
				output.write("" + count);
				output.write('\n');
			}
			s.close();
			output.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
