/*
 * 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.my;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;

public class Main {

	public static void main(String[] args) {
		try {
			RecycledNumbers r = new RecycledNumbers();

			String fileLocation = "C://Training//Google//RecycledNumbers//src//com//my//smallInput.txt";

			BufferedReader reader = r.getInputFile(fileLocation);

			String line = reader.readLine();
			int count =1;
			while ( ( line = reader.readLine()) != null	 ) {

				String inputs[] = line.split(" " );
				int numCount = r.recycle(Integer.parseInt(inputs[0]),Integer.parseInt(inputs[1]));

				System.out.println("Case #" + count + ": " + numCount);
				
				++count;
			}

			//System.out.println(r.recycle(100,999));
		} catch (Exception e) {
			// TODO: handle exception
		}
	}
}

class RecycledNumbers	{


	public BufferedReader getInputFile(String fileLocation)	throws Exception{

		BufferedReader reader = new BufferedReader(new FileReader(new File(fileLocation)));

		return reader;
	}

	int recycle(int first, int second) throws Exception{

		int count = 0;

		for( int i=first; i<=second; ++i)	{

			String str = Integer.toString(i);
			Set  set = new HashSet();

			int div = 1;

			for( int j =0 ; j<str.length()-1; ++j)	{

				div = div*10;
				int trail = i % div ;

				String s = str.substring(0,str.length()- (j+1));
				int newNum = Integer.parseInt(trail + s);

				if( i < newNum && newNum <= second)	{
 					if( !set.contains(newNum))	{
						set.add(newNum);
						++count;
					}
				}
			}


		}

		return count;
	}
}
