import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {

	private static BufferedReader bufferedReader = new BufferedReader(
			new InputStreamReader(System.in));

	public static void main(String[] args) throws IOException {
		String line = bufferedReader.readLine();
		int cases = Integer.parseInt(line);

		for (int i = 1; i <= cases; i++) {
			line = bufferedReader.readLine();
			String[] split = line.split(" ");

			int A = Integer.parseInt(split[0]);
			int B = Integer.parseInt(split[1]);

			HashSet<String> usedPairs = new HashSet<String>();

			int answer = 0;
			int duplicates = 0;
			if (B > 10) {
				for (int j = A; j < B; j++) {
					String number = "" + j;
					// System.err.println("Current number: " + number);
					for (int k = 0; k < number.length(); k++) {
						String rotated = number.substring(k)
								+ number.substring(0, k);
						// System.err.println("Rotated number: " + rotated);
						int a = Integer.parseInt(number);
						int b = Integer.parseInt(rotated);

						if (Math.min(a, b) >= A && a != b
								&& Math.max(a, b) <= B) {
							String hashKey;
							if (a < b) {
								hashKey = number + rotated;
							} else {
								hashKey = rotated + number;
							}
							if (!usedPairs.contains(hashKey)) {
								answer++;
								usedPairs.add(hashKey);
								// System.err.println("Found a new pair!");
							} else {
								/*
								 * System.err
								 * .println("Found a duplicate: Number - " +
								 * number + ", Rotated: " + rotated);
								 */
								duplicates++;
							}
						}
					}
				}
			}
			// System.err.println("Found " + duplicates + " duplicated pairs");
			System.out.println("Case #" + i + ": " + answer);
		}
	}

}
