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

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

import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author Luis Sergio Curay
 */
public class c {

    public c() {
        Scanner in= new Scanner(System.in);
        int t= in.nextInt();
        for (int i = 0; i < t; i++) {
            int a= in.nextInt();
            int b= in.nextInt();
            HashSet<Integer> nums= new HashSet<Integer>();
            int res= 0;
            for (int j = a; j <= b; j++) {
                HashSet<Integer> comb= combinaroty(j);
                for (Integer num : comb) {
                    if(num >= a && num <= b && num != j) {
                        if(!nums.contains(num)) {
                            nums.add(j);
                            res++;
                        }
                    }
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + res);
        }
    }
    
    public int reverse(int n) {
        String num= String.valueOf(n);
        for (int i = 0; i < num.length() - 1; i++) {
            num= num.substring(num.length() - 1) + num.substring(0, num.length() - 1);
        }
        return Integer.parseInt(num);
    }
    
    private HashSet<Integer> combinaroty(int n) {
        HashSet<Integer> res= new HashSet<Integer>();
        String num= String.valueOf(n);
        for (int i = 0; i < num.length() - 1; i++) {
            num= num.substring(num.length() - 1) + num.substring(0, num.length() - 1);
            res.add(Integer.parseInt(num));
        }
        return res;
    }
}