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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class C {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
        PrintWriter out = new PrintWriter("c.out");
        StringTokenizer k;
        int t,a,b,x,y,count;
        HashSet<Integer> h;
        String s;
        int ar [] = new int[7];
        ar[0]=1;
        ar[1]=10;
        ar[2]=100;
        ar[3]=1000;
        ar[4]=10000;
        ar[5]=100000;
        ar[6]=1000000;
        t=Integer.parseInt(in.readLine().trim());
        for (int i = 1; i <= t; i++) {
            count=0;
            k=new StringTokenizer(in.readLine());
            a=Integer.parseInt(k.nextToken());
            b=Integer.parseInt(k.nextToken());
            for (int j = a; j <= b; j++) {
                h=new HashSet<Integer>(6);
                x=j;
                s=j+"";
                for (int l = 0; l < s.length()-1; l++) {
                    y=x%10;
                    y*=ar[s.length()-1];
                    y+=x/10;
                    if(y>j && y<=b && y!=x){
                        if(h.add(y))
                            count++;
                    }
                    x=y;
                }
            }
            out.append("Case #"+i+": "+count+"\n");
        }
        out.close();
    }
}
