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

import java.io.*;
import java.util.*;
public class Entry {

	private static ArrayList<Integer> cases=new ArrayList<Integer>();
	
	public static void main(String args[]) throws IOException
	{
		FileReader src=new FileReader("test.txt");
		FileWriter f=new FileWriter("output.txt");
		BufferedWriter out=new BufferedWriter(f);
		Scanner in=new Scanner(src);
		int iterate=in.nextInt();
		int i,j;
		int A,B;
		int n,m;
		
		HashSet<Double> dub=new HashSet<Double>();
		for(i=0;i<iterate;i++)
		{
			A=in.nextInt();
			B=in.nextInt();
			n=A;
			while(n< B)
			{
				for(j=1;j<Integer.toString(n).length();j++)
				{
					m=reverse(n,j);
					if((A<=n)&& (n<m) &&(m<=B) &&(m!=n))
					{
						dub.add((n*Math.pow(10,Integer.toString(n).length()))+m);
					}
				}
				n++;
			}
			cases.add(dub.size());
			dub.clear();
			
		}
		
		int index=1;
		for(int str:cases)
		{
			out.write(("Case #"+index+":\t"+str));
			out.write("\n");
			index++;
		}
		out.close();
		in.close();
	}
	
   
	private static int reverse(int n,int j)
	{
		String str=Integer.toString(n);
		String ans=str.substring(str.length()-j);
		String ans2=str.substring(0,str.length()-j);
		str=ans+ans2;
		int m=Integer.valueOf(str);
		return m;
	}
	
}
