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

import java.io.*;
import java.util.HashSet;
public class Numb {
    public static void main(String[] args)throws IOException{
        HashSet<Integer> hs;
        BufferedReader cin=new BufferedReader(new FileReader("i3.in"));
        PrintWriter cout=new PrintWriter(new BufferedWriter(new FileWriter("out3.txt")));
        String[] in;
        int x,y,j,num,count;
        int t=Integer.parseInt(cin.readLine());
        for(int i=0;i<t;i++){
            count=0;
            in=cin.readLine().split(" ");
            x=Integer.parseInt(in[0]);
            y=Integer.parseInt(in[1]);
            if(y<10){ cout.println("Case #"+(i+1)+": 0");continue;}
            for(j=x;j<=y;j++){
                hs=new HashSet<Integer>();
                    String s=Integer.toString(j);
                    int l=s.length();
                    for(int k=l-1;k>0;k--){
                        if(s.charAt(k)=='0') continue;
                        num=Integer.parseInt(s.substring(k)+s.substring(0,k));
                        if(num>j && num<=y && !hs.contains(num)){
                            hs.add(num);
                            count++;
                        }
                    }
            }
            cout.println("Case #"+(i+1)+": "+count);
        }
        cout.flush();
    }
}
