/*
 * 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.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;


public class recycle {
	static int count=0;
	static int A = 0;
	static int B = 0;
	
	public static void permutes(String start){
		int n = Integer.valueOf(start);
		for(int i=1;i<start.length();i++){
			String current = start.substring(0, i);
			String rest = start.substring(i, start.length());
			String finish = rest+current;
			int m = Integer.valueOf(finish);
			if(n==m){
				break;
			}
				
			if(m<=B && n<m){
				count++;
			
			}
		}
		
	}
	public static void main(String args[])
	 {
		String line;
		  int i=0;
		  try{
		  FileInputStream fstream1 = new FileInputStream("Ctest.txt");
		  DataInputStream in1 = new DataInputStream(fstream1);
		  BufferedReader br1 = new BufferedReader(new InputStreamReader(in1));
		  FileWriter fw = new FileWriter("outC.txt");
		  BufferedWriter out = new BufferedWriter(fw);
		 
		  while ((line = br1.readLine()) != null)   {  
		  		

		  		if(i!=0){
		  			String outpt = "Case #"+i+": ";
		  			String brkline[]=line.split(" ");
		  			A = Integer.valueOf(brkline[0]);
		  			//System.out.println("A= "+A);
		  			B = Integer.valueOf(brkline[1]);
		  			//System.out.println("B= "+B);
		  			
		  			for(int p=A;p<=B;p++){
		  				permutes(String.valueOf(p));
		  			}
		  			outpt = outpt+count;		
		  			out.write(outpt+"\n");
		  			System.out.println(outpt);
		  			}
		  		
		  		i++;
		  		count=0;
		  	  }
		  
		  //Close the input stream
		  in1.close();
		  //Close the output stream
		  out.close();
		    }catch (Exception e){//Catch exception if any
		  System.err.println("Error: " + e);
		  }
/////////////////////////////////////////////////				
		
	 }
}
