package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;

public class RecycledNumbers {

	public static void main(String[] args) throws IOException {
		BufferedReader bfr = new BufferedReader(
				new InputStreamReader(System.in));
		PrintWriter pr = new PrintWriter(System.out);
		int n = Integer.parseInt(bfr.readLine());
		for (int i = 1; i <= n; i++) {
			String input[] = bfr.readLine().split(" ");
			int max = Integer.parseInt(input[1]);
			int count = 0;
			int min = Integer.parseInt(input[0]);
			for (; min < max; min++) {
				String moved = String.valueOf(min).charAt(
						String.valueOf(min).length() - 1)
						+ String.valueOf(min).substring(0,
								String.valueOf(min).length() - 1);
				if (Integer.parseInt(moved) <= max
						&& Integer.parseInt(moved) > min)
					count++;
				while (Integer.parseInt(moved) != min) {
					moved = moved.charAt(moved.length() - 1)
							+ moved.substring(0, moved.length() - 1);
					if (Integer.parseInt(moved) <= max
							&& Integer.parseInt(moved) > min)
						count++;
				}
			}
			pr.printf("Case #%d: %d\n", i, count);
			pr.flush();
		}
	}
}
