import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"c-large.out")));
		Scanner in = new Scanner(new File("C-large.in"));

		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int count = 0;

			// boolean[] visited = new boolean[B - A + 1];
			for (int n = A; n <= B; n++) {
				// if (!visited[n]) {
				String origstr = Integer.valueOf(n).toString();
				String str = shift(origstr);
				while (!str.equals(origstr)) {
					int shifted = Integer.parseInt(str);

					// System.out.printf("n: %d, shift: %s, shifted: %d, valid: %b\n",
					// n, str, shifted, shifted > n);

					if (shifted > n && shifted <= B)
						count++;

					str = shift(str);
				}
				// }
			}

			out.printf("Case #%d: %d\n", i, count);
		}

		in.close();
		out.close();
	}

	public static String shift(String num) {
		return num.charAt(num.length() - 1)
				+ num.substring(0, num.length() - 1);
	}
}
