/*
 * 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.util.ArrayList;
import java.util.Arrays;

/**
 * Created by IntelliJ IDEA.
 * User: Abhishek
 * Date: 4/14/12
 * Time: 1:09 PM
 * To change this template use File | Settings | File Templates.
 */
public class RecNum {
    public int recycled(String a, String b){
        int a1 = Integer.parseInt(a);
        int b1 = Integer.parseInt(b);
        int num = a1;
        int count=0;
        while(num<=b1){
            String x = String.valueOf(num);
            ArrayList<String> store = new ArrayList<String>(10);
            for(int i=1; i<x.length(); i++){
                String y = x.substring(x.length()-i, x.length())+x.substring(0, x.length()-i);

                int k = Integer.parseInt(y);
                if(k<=b1 && k>num && !store.contains(y)){
                    count++;
                    store.add(y);
                }
            }
            num++;

        }
        return count;
    }
    public static void main(String[] args) {
        RecNum spk = new RecNum();
        try {
            BufferedReader buff = new BufferedReader(new FileReader("C-small-attempt0.in"));
            FileWriter fstream = new FileWriter("out1.txt");
            BufferedWriter out = new BufferedWriter(fstream);
            int numTest = Integer.parseInt(buff.readLine());
            if (numTest < 1 || numTest > 50)
                System.exit(0);

            for (int k = 0; k < numTest; k++) {
                String[] inp = buff.readLine().split(" ");

                out.write("Case #" + (k + 1) + ": " + spk.recycled(inp[0],inp[1]));
                out.write("\n");
//                System.out.println("Case #" + (k + 1) + ": " + spk.recycled(inp[0],inp[1])+"\n");


            }
            out.close();

        } catch (Exception e) {
            System.out.println("Exception" + e);
        }
    }
}
