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 Recyclers {

	private static int countRecycled(int a, int b) {
		int recycled = 0;
		for (int i = a; i <= b; i++) {
			String s = new Integer(i).toString();
			for (int j = 0; j < s.length() - 1; j++) {
				String o = s.substring(s.length() - j - 1, s.length()).concat(
						s.substring(0, s.length() - j - 1));
				int n = Integer.valueOf(s);
				int m = Integer.valueOf(o);
				if (n < m && m <= b) {
					recycled++;
				}
			}
		}
		return recycled;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int x = 0; x < cases; x++) {
			sc.nextLine();
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = countRecycled(a, b);
			System.out.println("Case #" + (x + 1) + ": " + c);
		}
	}
}
