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

public class Csmall {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new FileReader("./src/qualification/C-small-attempt0.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("./src/qualification/C-small-attempt0.out"));
		int[][] inputs = new int[50][2];
		int casenumber = 0;
		String input = null;
		int total = 0;
		while((input=br.readLine()) != null)
		{
			if(casenumber==0)
			{
				total = Integer.parseInt(input);
			}else{
				String[] array = input.split(" ");
				inputs[casenumber-1][0] = Integer.parseInt(array[0]);
				inputs[casenumber-1][1] = Integer.parseInt(array[1]);
			}
			casenumber++;
		}
		casenumber=1;
		while(casenumber <= total)
		{
			System.out.println("Case #" + casenumber + ": " + String.valueOf(recycledNumbers(inputs[casenumber-1][0], inputs[casenumber-1][1])));
			bw.write("Case #" + casenumber + ": " + String.valueOf(recycledNumbers(inputs[casenumber-1][0], inputs[casenumber-1][1])));
			bw.newLine();
			casenumber++;
		}
		bw.close();
	}
	
	public static int recycledNumbers(int a, int b) throws IOException
	{
		int[] storage = new int[2000000];
		int count=0;
		for(int i=a;i<b+1;i++)
		{
			for(int j=a+1;j<b+1;j++)
			{
				if(i!=j && storage[j]==0)
				{
					String icopy = String.valueOf(i);
					String jcopy = String.valueOf(j);
					for(int k=0;k<icopy.length();k++)
					{
						icopy = shiftString(icopy).toString();
						if(icopy.compareTo(jcopy)==0)
						{
							storage[i]=1;
							count++;
						}
					}
				}
			}
		}
		return count;
	}
	
	public static StringBuffer shiftString(String input)
	{
		StringBuffer output = new StringBuffer();
		output.append(input.charAt(input.length()-1));
		for(int i=0;i<input.length()-1;i++)
		{
			output.append(input.charAt(i));
		}
		return output;
	}
}