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.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Set;

public class C {
    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("file.in"));
        PrintStream out = new PrintStream(new FileOutputStream("file.out"));

        int nLines = Integer.parseInt(in.readLine());

        String[] s;

        for (int i = 1; i <= nLines; i++) {
            s = in.readLine().split(" ");

            int nA = Integer.valueOf(s[0]);

            int nB = Integer.valueOf(s[1]);

            int result = 0;

            Set<String> set = new HashSet<String>();

            if (nB > 10) {

                int start = Math.max(nA, 11);

                for (int j = start; j <= nB; j++) {

                    String st = String.valueOf(j);

                    for (int k = 1; k < st.length(); k++) {

                        String res = st.substring(k) + st.substring(0, k);
                        if (!res.startsWith("0") && !st.equals(res)
                                && st.length() == res.length()) {

                            int v = Integer.valueOf(res);

                            if (v <= nB && j < v) {
                                set.add(st + "," + res);
                            }

                        }

                    }

                }

            }
            result = set.size();

            out.println("Case #" + i + ": " + result);
        }

        in.close();
        out.close();
    }
}
