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

}

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class NumberRecycling {

    /**
     * @param args
     */
    public static void main(String[] args) {
	// TODO Auto-generated method stub
	try {
	    FileInputStream fstream = new FileInputStream("D:/work/java dev/Google code jam 2012/bin/C-small-attempt0.in");
	    // Get the object of DataInputStream
	    DataInputStream in = new DataInputStream(fstream);
	    BufferedReader reader = new BufferedReader(new InputStreamReader(in));
	    String numberOfTest = reader.readLine();
	    Integer T = Integer.valueOf(numberOfTest);
	    File result = new File("D:/work/java dev/Google code jam 2012/bin/Cresult.txt");
	    FileWriter writer = new FileWriter(result);
	    PrintWriter pWriter = new PrintWriter(writer);
	    for (int j = 0; j < T; j++) {
		String[] dataset = reader.readLine().split(" ");
		int A = Integer.valueOf(dataset[0]);
		int B = Integer.valueOf(dataset[1]);
		int numberOfRecycledPairs = 0;
		for (int n = A; n <= B; n++) {
		    for (int m = n + 1; m <= B; m++) {
			if (n != m) {
			    if (isRecycleNumbers(String.valueOf(n), String.valueOf(m))) {
				numberOfRecycledPairs++;
			    }
			}
		    }
		}
		pWriter.println("Case #" + (j + 1) + ": " + numberOfRecycledPairs);
	    }
	    pWriter.flush();
	    pWriter.close();
	} catch (FileNotFoundException e) {
	    // TODO Auto-generated catch block
	    e.printStackTrace();
	} catch (IOException e) {
	    // TODO Auto-generated catch block
	    e.printStackTrace();
	}
    }

    private static boolean isRecycleNumbers(String n, String m) {
	boolean result = false;
	for (int i = 1; i < n.length(); i++) {
	    String nPrime = moveNumberToTheBack(n, i);
	    if (nPrime.equals(m)) {
		return true;
	    }
	}
	return result;
    }

    private static String moveNumberToTheBack(String n, int i) {
	String start = n.substring(i);
	String end = n.substring(0, i);
	return start + end;
    }
}
