/*
 * 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 gcj;
 
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Mervin.Lavin
 */
public class Gcj
{

    public static void main
        (String[] args)
        throws Exception
    {
        doProb3( "C-small-attempt1.in", "output.txt" );
    }
    
    private static void doProb3
        ( String inputFileName, String outputFileName )
        throws Exception
    {
        File inputFile = new File( inputFileName );
        Scanner scanner = null;
        scanner = new Scanner( inputFile );
        File outputFile = new File( outputFileName );
        BufferedWriter output = new BufferedWriter( new FileWriter( outputFile ) );
        
        int a, b, otherPairs;
        HashMap<Integer,Integer> distinctPairs;
        int testCases = scanner.nextInt();
        for ( int caseNum = 1; caseNum <= testCases; caseNum++ )
        {
          a = scanner.nextInt();
          b = scanner.nextInt();
          distinctPairs = new HashMap<Integer,Integer>();
          otherPairs = 0;
          for ( int n = a; n < b; n++ )
          {
              String stringN = Integer.toString(n);
              if ( stringN.length() == 1 )
              {
                  continue;
              }
              for ( int index = 1; index < stringN.length(); index++ )
              {
                  String stringM = 
                      stringN.substring( index, stringN.length() ) 
                      + stringN.substring( 0, index );
                  int m = Integer.parseInt( stringM );
                  if ( ( !stringN.equals( stringM ) )
                      && ( n < m ) && ( m <= b ) )
                  {
                      if ( distinctPairs.containsKey( n ) && !distinctPairs.containsValue( m ) )
                      {
                          otherPairs++;
                      }
                      else 
                      {
                          distinctPairs.put( n, m );
                      }
                  }
              }
          }
          output.append( "Case #" + caseNum + ": " +  ( distinctPairs.size() + otherPairs ) );
          output.newLine();
        }
        scanner.close();
        output.close();
    }
}
