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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.BufferedWriter;
import java.io.FileWriter;

public class RecycledNumber {

		public String count(int A, int B, int caseNr)
		{
			StringBuffer sb = new StringBuffer("");
			sb.append("Case #");
			sb.append(caseNr);
			sb.append(": ");
			int result = 0;
			for (int i = A; i <= B; i++)
			{
				result += recycled(i, B);
			}
			sb.append(result);
			return sb.toString();
		}

		public int recycled(int nr, int max)
		{
			if (nr < 12) return 0;
			int test = nr;
			int count = 0;
			int length = (int)Math.ceil(Math.log10((double)nr));
			int[] digits = new int[length];
			for (int i = length-1; i >=0; i--)
			{
				digits[i] = test%10;
				test = test/10;
			}
			int[] valuesFound = new int[length];
			for (int i = 0; i < length; i++)
			{
				if (digits[i] != 0)
				{
					int value = 0;
					for (int j = 0; j < length; j++)
					{
						value = value*10;
						value += digits[(i+j)%length];
					}
					valuesFound[i] = value;
					if ((value > nr) && (value <= max)) 
					{
						boolean found = false;
						for (int k = 0; k < i; k++)
						{
							if (valuesFound[k] == valuesFound[i]) found = true;
						}
						//System.out.println(nr + " " + value);
						if (!found) count++;
					}
				}
			}
			return count;
		}
		/**
		 * @param args
		 */
		public static void main(String[] args) 
		{
			RecycledNumber test = new RecycledNumber();
			String fileName = "in3.txt";
			String outName = "out3.txt";
			try
			{
				BufferedReader br = new BufferedReader(new FileReader(fileName));
				String line = br.readLine();
				BufferedWriter bw = new BufferedWriter(new FileWriter(outName));
				int tests = new Integer(line).intValue();
				for (int i = 0; i < tests; i++)
				{
					line = br.readLine();
					String[] parts = line.split(" ");
					int A = new Integer(parts[0]).intValue();
					int B = new Integer(parts[1]).intValue();
					String line2 = test.count(A, B, i+1);
					System.out.println(line2);
					bw.write(line2+"\n");
				}
				bw.flush();
			}
			catch (Exception e)
			{
				e.printStackTrace();
			}			
		}
}

/**
Input 
Ê
4
1 9
10 40
100 500
1111 2222
Output 
Ê
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
*/