/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

package codejam;

import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.HashSet;

public class _Q_C {
	public static void main(String[] args) throws Exception {
		String input_file = "C-small-attempt0.in";
		String output_file = "_Q_C_small_out.txt";
	
		BufferedReader in = new BufferedReader(new FileReader(input_file));
		PrintStream out = new PrintStream(new FileOutputStream(output_file));
		
		in.readLine();
		String line;
		int case_num = 1;
		while ((line=in.readLine()) != null) {  
			String[] line_str = line.split(" ");
			int a = Integer.parseInt(line_str[0]);
			int b = Integer.parseInt(line_str[1]);
			
			HashSet<String> hs = new HashSet<String>();
			for (Integer n = a; n <= b; ++n) {
				String n_str = n.toString();
				int len = n_str.length();
				for (int r = 1; r < len; ++r) {
					String rotated_n_str =
						n_str.substring(len - r) + n_str.substring(0, len - r);
					if (isValidPair(a, b, n_str, rotated_n_str)) {						
						String check_str =
							removeLeadingZero(n_str) + "_" +
							removeLeadingZero(rotated_n_str);
						String check_str_rev =
							removeLeadingZero(rotated_n_str) + "_" +
							removeLeadingZero(n_str);
						if (!hs.contains(check_str) &&
								!hs.contains(check_str_rev)) {
							int rotated_n =
								Integer.parseInt(rotated_n_str);
							if (n <= rotated_n)
								hs.add(check_str);
							else
								hs.add(check_str_rev);
						}						
					}
				}
			}
						
			//System.out.println("Case #" + case_num + ": " + hs.size() + "\n" + hs.toString());
			out.println("Case #" + case_num + ": " + hs.size());
			++case_num;
		}
	}
	
	private static boolean isValidPair(int a, int b, String n_str, String m_str) {		
		Integer n = Integer.parseInt(n_str);
		Integer m = Integer.parseInt(m_str);
		
		String n_str_strip = n.toString();
		String m_str_strip = m.toString();
		
		return (n_str_strip.length() == m_str_strip.length() &&
				a <= n && n < m && m <= b);		
	}
	
	private static String removeLeadingZero(String s) {
		int i = 0;
		for (; i < s.length(); ++i) {
			if (s.charAt(i) != '0')
				break;
		}
		return s.substring(i);
	}
}
