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.util.Scanner;

public class C {

	static boolean iftrue(int n, int m) {
		String aa = n + "";

		if (n == m)
			return false;

		for (int i = 1; i < aa.length(); i++) {
			String ll = aa.substring(i, aa.length());
			String bb = aa.substring(0, i);

			String ss = ll + bb;
			if (ss.equals(m + "") && m > n) {
				return true;
			}
		}

		return false;
	}

	public static void main(String[] args) {

		//System.out.println(iftrue(12, 31));
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {

			int A = in.nextInt();
			int B = in.nextInt();

			int res = 0;

			for (int k = A; k <= B; k++) {
				for (int l = k + 1; l <= B; l++) {
					if (iftrue(k, l))
						res++;
				}
			}
			System.out.format("Case #%d: %s\n", i + 1, res);
		}
	}
}
