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

import Controller.IO;

public class RecycledNumbersCase extends CaseSolver {

	public RecycledNumbersCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	int a, b;

	@Override
	public void addLine(String line) {
		String[] str = line.split(" ");
		a = Integer.parseInt(str[0]);
		b = Integer.parseInt(str[1]);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + cont);
	}

	int cont;

	@Override
	public CaseSolver process() {
		for (int m = a; m < b; m++) {
			for (int n = m + 1; n <= b; n++) {
				//System.err.println(m + " e " + n);
				if (isRecycled(m, n)) {
					cont++;
				}
			}
		}

		return this;
	}

	private boolean isRecycled(int m, int n) {
		StringBuilder a = new StringBuilder("" + m);
		String b = "" + n;

		for (int i = 0; i < a.length() - 1; i++) {
			a.insert(0, a.charAt(a.length() - 1)).deleteCharAt(a.length() - 1);
			if (a.toString().equals(b)) {
				return true;
			}
		}

		return false;
	}

	@Override
	public void initializeVars() {
		// TODO Auto-generated method stub

	}

}
