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

import java.io.*;
import java.util.*;

public class ProblemC {

	public static Set<Integer> h;
	/**
	 * @param args
	 */
	public static void main(String[] args)  throws IOException{
		Scanner sc = new Scanner(new FileReader("C.in"));
		PrintWriter out = new PrintWriter(new FileWriter("C.out"));
		int t = sc.nextInt();
		for (int caseNum = 1; caseNum <= t; caseNum++)
		{
			h = new HashSet<Integer>();
			int a = sc.nextInt();
			int b = sc.nextInt();
			int p = a;
			int count = 0;
			while (p<=b)
			{
				if (!h.contains(p))
				{
					count += rolling(p, a, b);					
				}
				p++;
			}
			out.println("Case #"+caseNum+": "+count);
		}
		out.close();
	}
	public static int rolling(int num,int a,int b)
	{
		h.add(num);
		String sNum = Integer.toString(num);
		String s = new String(sNum);
		int count = 1;
		for (int i = 0; i < sNum.length()-1; i++)
		{
			s = s.substring(s.length()-1).concat(s.substring(0,s.length()-1));
			//System.out.println(s);
			int p = Integer.parseInt(s);
			if (p == num)
				break;
			if (p >= a && p <= b )
			{
				h.add(p);
				count++;
			}
		}
		//return count;
		return (count-1)*count/2;
	}

}
