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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

public class ProblemC {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		FileReader fr = new FileReader("C.in");
		FileWriter fw = new FileWriter("C.out");
		BufferedReader in = new BufferedReader(fr);
		int cases = Integer.parseInt(in.readLine()), kase = 0;
		StringTokenizer s;
		while(cases-- > 0) {
			int A, B, count = 0;
			s = new StringTokenizer(in.readLine());
			A = Integer.parseInt(s.nextToken());
			B = Integer.parseInt(s.nextToken());
			for(int i = A; i < B; i++) {
				for(int j = i + 1; j <= B; j++) {
					String str = i + "";
					for(int c = 0; c < str.length(); c++) {
						String a = str.substring(c);
						String b = str.substring(0, c);
						String res = a + b;
						if(Integer.parseInt(res) == j) {
							count++;
							break;
						}
					}
				}
			}
			fw.write("Case #" + ++kase + ": " + count + "\n");
		}
		fw.close();
	}

}
