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

package com.sokamura.gcj2012;

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

public class RecycledNumbers {
	public int solve(int n1, int n2) {
		int ans = 0;
		for(int i=n1; i<n2; ++i) {
			Set<Integer> list = generate(i);
			for(int n : list) {
				if(n <= n2){ ans++; }
			}
		}
		return ans;
	}
	
	private Set<Integer> generate(int n) {
		String s = String.valueOf(n);
		Set<Integer> list = new HashSet<Integer>();
		for(int i=1; i<s.length(); ++i) {
			int n2 = Integer.parseInt(s.substring(i) + s.substring(0, i));
			if(n < n2) {
				list.add(n2);
			}
		}
		return list;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO ©®¶¬³ê½\bhEX^u
		RecycledNumbers rn = new RecycledNumbers();
		try {
			FileReader fr = new FileReader("C-small-attempt1.in");
			BufferedReader br = new BufferedReader(fr);
			String lineNum;
			lineNum = br.readLine();
			for(int i=1; i<=Integer.parseInt(lineNum); ++i) {
				String line = br.readLine();
				String[] array = line.split(" ");
				int n1 = Integer.parseInt(array[0]);
				int n2 = Integer.parseInt(array[1]);
				System.out.println("Case #" + i + ": " + rn.solve(n1,n2));
			}
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}

}
