/*
 * 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 qualification;

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Collection;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumber {
	public static void main(String[] args) throws IOException {
		String inputFile = "C-small-attempt0.in";
		Scanner input = new Scanner(new FileInputStream(inputFile));

		FileOutputStream out = new FileOutputStream(inputFile + ".out", false);
		slove(input, out);
		out.close();
	}
	
	private static void slove(Scanner input, FileOutputStream out) throws IOException
	{
		int cases = input.nextInt();
		for (int caseOrder = 1; caseOrder <= cases; caseOrder++) {
			int a = input.nextInt();
			int b = input.nextInt();
			
			long r = 0;
			for (int i = a; i <= b; i++) {
				for (int x: getRecycled(i)) {
					if (x >= a && x <= b && i < x && x > 0) {
						// System.out.printf("(%d, %d)\n", i, x);
						r++;
					}
				}
			}
			
			String outline = String.format("Case #%d: %d\r\n",  caseOrder, r);
			System.out.print(outline);
			out.write(outline.getBytes());
		}
	}
	
	private static Collection<Integer> getRecycled(int a)
	{
		String s = Integer.toString(a);
		HashSet<Integer> ret = new HashSet<Integer>();
		for (int i = 1; i < s.length(); i++) {
			String s2 = s.substring(i) + s.substring(0, i);
			if (!s2.startsWith("0")) {
				ret.add(Integer.parseInt(s2));	
			}
		}
		return ret;
	}
}
