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

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;

public class Parser {

	private String inputFileDest;
	private FileInputStream fileInputStream;

	public Parser(String inputFileDest) {
		super();
		this.inputFileDest = inputFileDest;
		try {
			fileInputStream = new FileInputStream(new File(inputFileDest));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	public String getInputFileDest() {
		return inputFileDest;
	}

	public void setInputFileDest(String inputFileDest) {
		this.inputFileDest = inputFileDest;
	}

	public FileInputStream getFileInputStream() {
		return fileInputStream;
	}

	public void setFileInputStream(FileInputStream fileInputStream) {
		this.fileInputStream = fileInputStream;
	}
	
	@SuppressWarnings("unchecked")
	public ArrayList<Integer>[] toArray(){
		
		Scanner scan = new Scanner(getFileInputStream());
		
		// The first line must be an number
		Integer nbOfLines = new Integer(scan.nextLine());
		
		ArrayList<Integer>[] parsedData = new ArrayList[nbOfLines];
		int index = 0;
		
		while (scan.hasNextLine()){
			
			String line = scan.nextLine();
			String[] datas = line.split(" ");
			
			ArrayList<Integer> dataRow = new ArrayList<Integer>();
			
			for (String data : datas){
				dataRow.add(new Integer(data));
			}
			
			parsedData[index] = dataRow;
			index++;
		}
		
		return parsedData;
		
	}
	
	
}
