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

/**
 * Created by IntelliJ IDEA.
 * User: danghiskhan
 * Date: 4/14/12
 * Time: 11:44 PM
 */
public class Recycled {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        Integer caseCount = 1;

        while (in.hasNextInt()) {
            Integer start = in.nextInt();
            Integer finish = in.nextInt();

            Integer count = 0;

            ArrayList<String> duplicates = new ArrayList<String>();

            for (Integer i = start; i < finish; i++) {
                for (Integer j = i + 1; j <= finish; j++) {

                    String n = i.toString();
                    String m = j.toString();

                    String nPerm;

                    if (n.length() > 1) {
                        for (Integer k = 1; k < n.length(); k++) {
                            nPerm = n.substring(k, n.length()) + n.substring(0, k);

                            Integer nPermInt = Integer.parseInt(nPerm);

                            String dupe = nPerm + ":" + n;

                            if (nPerm.equals(m) && nPermInt > i && !duplicates.contains(dupe)) {
                                //System.out.println("n:" + n + " nPerm: " + nPerm);

                                duplicates.add(dupe);

                                count++;
                            }
                        }
                    }

                }
            }

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

    }
}
