/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;

public class RecycledNumbers {
	
	public static void main(String [] args){
		String fileIn = "C:\\CodeJam\\C-small-attempt0.in";
		ArrayList<String> lines = getLines(fileIn);
		StringBuffer result = new StringBuffer();
		if(lines!=null){			
			String firstLine[] = lines.get(0).split(" ");
			int caseTotal = Integer.parseInt(firstLine[0]);
			for(int i = 0; i<caseTotal; i++){
				String[] line = lines.get(i+1).split(" ");
				result.append("Case #"+(i+1)+": "+ getResult(line)+"\n");
			}
		}
			
		String fileOut = "C:\\CodeJam\\C-small-attempt0.out";
		writeFile(fileOut, result.toString());	
	}
	
	public static int getResult(String[] line){
		String str = line[0];
		int line0 = Integer.parseInt(line[0]);
		int line1 = Integer.parseInt(line[1]);
		int tot = 0;
		HashMap<Object, Object> map = new HashMap<Object, Object>();
		for(int i=line0;i<=line1;i++){
			for(int j=1; j<str.length();j++){
				String strAll = i+"";
				String str1 = strAll.substring(j);
				String str2 = strAll.substring(0,j);
				int strResult = Integer.parseInt(str1+str2);
				if(line0<=strResult && strResult<=line1){
					if(map.get(strAll+","+strResult)==null && !strAll.equalsIgnoreCase(strResult+"")){
						map.put(strAll+","+strResult,"Exist");
						map.put(strResult+","+strAll,"Exist");
						tot++;
					}
				}
			}  
		}
		return tot;
	}
	
	public static void writeFile(String filePath, String content){
		try{
			PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(filePath)));
			out.write(content);
			out.close();
		}
		catch(IOException e){
			e.printStackTrace();
		}
	}
	
	public static ArrayList<String> getLines(String filePath){
		ArrayList<String> lines = null;	
		try{
			lines = new ArrayList<String>();
			String str;	    	   
		    BufferedReader in = new BufferedReader( new FileReader(filePath));
		    while ((str = in.readLine()) != null) {
		    	lines.add(str);	      
		    }	    
		    in.close();
		}catch(IOException e){
			e.printStackTrace();
		}
		return lines;
	}
}