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;
	}
}

package QR_2012;

import java.io.FileInputStream;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

import Utils.IOStreams;

public class C_Recycled_Numbers {

	public static void main(String[] args) throws IOException {

		IOStreams streams = new IOStreams(args[0]);
		System.setIn(new FileInputStream(args[0]));

		Scanner sc = new Scanner(System.in);
		sc.nextLine();

		int caseNum = 1;

		while (sc.hasNextInt()) {
			int lowerBoundInt = sc.nextInt();
			int upperBoundInt = sc.nextInt();

			int hits = 0;
			for (int num1 = lowerBoundInt; num1 <= upperBoundInt; num1++) {

				char[] num1Str = ("" + num1).toCharArray();
				int length = num1Str.length;
				Set<Integer> num2Duplicates = new HashSet<Integer>();

				for (int startingPoint = 0; startingPoint < length; startingPoint++) {

					int index = startingPoint;
					boolean init = true;
					StringBuffer num2Str = new StringBuffer();
					while (init || index % length != startingPoint) {
						init = false;
						num2Str.append(num1Str[index % length]);
						index++;
					}

					Integer num2 = new Integer(num2Str.toString());

					if (num1 < num2 && num2 <= upperBoundInt && !num2Duplicates.contains(num2)) {
						hits++;
						num2Duplicates.add(num2);
					}
				}
			}
			streams.printLine("Case #" + (caseNum++) + ": " + hits + "\n");
		}
		
		streams.closeStreams();

	}

}
