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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class Numbers {
	public static void main (String[] args) throws IOException {
		
		Scanner sc = new Scanner(new FileReader("numbers.in"));
		PrintWriter out = new PrintWriter(new FileWriter("NumbersAsmall.out"));
		int cases = sc.nextInt();
		
		for (int i = 0; i < cases; i++) {
			String aString = sc.next();
			String bString = sc.next();
			int a = Integer.parseInt(aString);
			int b = Integer.parseInt(bString);
			int count = 0;
			
			for (int j = a; j <= b; j++) {
				String currentString = String.valueOf(j);
				ArrayList<String> list = new ArrayList<String>();
					for (int k = 1; k < currentString.length(); k++) {
						
						String thisNewString = currentString.substring(currentString.length() - k, currentString.length()) + currentString.substring(0, currentString.length() - k);

						if (isAnagram(currentString, thisNewString)) {

						if (Integer.parseInt(thisNewString) >= a && Integer.parseInt(thisNewString) <= b && !currentString.equals(thisNewString)) {
							if (!list.contains(thisNewString)) {
								count++;
							}
							list.add(thisNewString);
						}
					}
				}
			}
			out.println("Case #" + (i + 1) + ": " + count/2);
			
		}
		out.close();
	}
	
	public static boolean isAnagram(String s1, String s2) {
		
		int[] char_set = new int[10];
		
		if(s1.length() != s2.length()) {
			return false;
		}
		
		for (int i = 0; i < s1.length(); i++) {
			char_set[s1.charAt(i) % 48]++;
		}
		
		for (int j = 0; j < s1.length(); j++) {
			char_set[s1.charAt(j) % 48]--;
		}
		
		for(int k = 0; k < char_set.length; k++) {
			if (char_set[k] != 0) {
				return false;
			}
		}
		
		return true;
	}
}
